transistor circuits
Recently Published Documents


TOTAL DOCUMENTS

313
(FIVE YEARS 8)

H-INDEX

26
(FIVE YEARS 0)

Informatics ◽  
2021 ◽  
Vol 18 (4) ◽  
pp. 96-107
Author(s):  
D. I. Cheremisinov ◽  
L. D. Cheremisinova

O b j e c t i v e s. With the increasing complexity of verification and simulation of modern VLSI, containing hundreds of millions of transistors, the means of extracting the hierarchical description at the level of logical elements froma flat description of circuits at the transistor level are becoming the main tools for computer-aided design and verification. Decompilation tools for transistor circuits can not only significantly reduce the time to perform VLSI topology check, but also provide the basis for generating test cases, logical reengineering of integrated circuits and reverse engineering to detect untrusted attachments.The objective of the work is to solve the problem of extracting the structure of the functional level from a flat circuit of the transistor level by recognizing in it subcircuits that implement logical elements.M e t h o d s. Graph based methods are proposed for solving some key problems arising at the stage of structural recognition of CMOS gates in a transistor circuit: partitioning a graph into connectivity components corresponding to transistor subcircuits; recognition of subcircuits that are logical elements, and functions implemented by them; forming a library of recognized gates and constructing two-level transistor circuit. The original flat and resulting two-level transistor circuits are presented in SPICE format.Re s u l t s. The proposed methods are implemented in C++ as a part of a transistor circuit decompilation programfor the case without any predetermined cell library. All steps of the proposed methods of structural CMOS gates recognition are performed in a linear time from the number of transistors in the initial circuit.Co n c l u s i o n.  The decompilation program has been tested on practical transistor-level circuits. Experiments indicate that the present tool is fast enough to process circuits with more than a hundred thousand transistors in a few minutes on a personal computer. Currently, the authors are developing methods for recognizing more complex elements in a transistor circuit, such as memory elements.


2021 ◽  
Vol 17 (3) ◽  
pp. 1-33
Author(s):  
Sourabh Kulkarni ◽  
Sachin Bhat ◽  
Csaba Andras Moritz

Artificial Intelligence is becoming ubiquitous in products and services that we use daily. Although the domain of AI has seen substantial improvements over recent years, its effectiveness is limited by the capabilities of current computing technology. Recently, there have been several architectural innovations for AI using emerging nanotechnology. These architectures implement mathematical computations of AI with circuits that utilize physical behavior of nanodevices purpose-built for such computations. This approach leads to a much greater efficiency vs. software algorithms running on von Neumann processors or CMOS architectures, which emulate the operations with transistor circuits. In this article, we provide a comprehensive survey of these architectural directions and categorize them based on their contributions. Furthermore, we discuss the potential offered by these directions with real-world examples. We also discuss major challenges and opportunities in this field.


2021 ◽  
Vol 7 (5) ◽  
pp. 2000906
Author(s):  
Sungjae Hong ◽  
Kang Lib Kim ◽  
Yongjae Cho ◽  
Hyunmin Cho ◽  
Ji Hoon Park ◽  
...  

2021 ◽  
pp. 2001023
Author(s):  
Li Ding ◽  
Pushkaraj Joshi ◽  
James Macdonald ◽  
Virendra Parab ◽  
Sanjiv Sambandan

2020 ◽  
Vol 67 (11) ◽  
pp. 4672-4676
Author(s):  
Jakob Leise ◽  
Jakob Pruefer ◽  
Aristeidis Nikolaou ◽  
Ghader Darbandy ◽  
Hagen Klauk ◽  
...  

2020 ◽  
Vol 67 (9) ◽  
pp. 3876-3882
Author(s):  
Kimihiko Kato ◽  
Tetsufumi Tanamoto ◽  
Takahiro Mori ◽  
Yukinori Morita ◽  
Takashi Matsukawa ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document