The problem of converting a flat transistor circuit into a hierarchical circuit of logical gatesis considered. The problem arises in layout versus schematic verification and reverse engineering of integrated circuits. The offered subcircuit recognition algorithm collects transistors into gates without using any predefined cell library. Graph-based methods are proposed for solving some key problems of subcircuit (CMOS gates) recognizing and logical network extraction. The presented graph methods have been implemented in C++ as a part of a decompilation program, which was tested using practical transistorlevel circuits
This paper presents a new approach to layout-to-circuit extraction for bipolar and BiC-MOS technolog...
Abstract—A new graph reduction approach to symbolic circuit analysis is developed in this paper. A B...
A transistor level representation for VLSI circuits is presented. This representation is simple but ...
Abstract—This paper tackles the VLSI circuit reverse engineer-ing problem. Actual VLSI circuits are ...
The problem of finding meaningful subcircuits in a logic layout appears in many contexts in computer...
The steady down scaling of CMOS device dimensions has been the main stimulus to the growth of microe...
The problem of extracting RTL modules from a gate level netlist has many interesting applications in...
Layout-to-circuit extractors are CAD software-tools that translate an IC layout into an equivalent n...
The applications of non-standard logic device are increasing fast in the industry. Many of these app...
This dissertation introduces an analytic approach to the problem of circuit network pattern recognit...
New methods for automated visual recognition of metal interconnect technological layers of integrate...
The layout versus schematic (LVS) analysis is an essential part of topology design verification, and...
This work focuses on the usage of dominators in circuit graphs in order to reduce the complexity of ...
The development of a theoretical basis for a technology-independent, false-error free, hierarchical ...
The problem of finding meaningful subcircuits in a logic layout appears in many contexts in computer...
This paper presents a new approach to layout-to-circuit extraction for bipolar and BiC-MOS technolog...
Abstract—A new graph reduction approach to symbolic circuit analysis is developed in this paper. A B...
A transistor level representation for VLSI circuits is presented. This representation is simple but ...
Abstract—This paper tackles the VLSI circuit reverse engineer-ing problem. Actual VLSI circuits are ...
The problem of finding meaningful subcircuits in a logic layout appears in many contexts in computer...
The steady down scaling of CMOS device dimensions has been the main stimulus to the growth of microe...
The problem of extracting RTL modules from a gate level netlist has many interesting applications in...
Layout-to-circuit extractors are CAD software-tools that translate an IC layout into an equivalent n...
The applications of non-standard logic device are increasing fast in the industry. Many of these app...
This dissertation introduces an analytic approach to the problem of circuit network pattern recognit...
New methods for automated visual recognition of metal interconnect technological layers of integrate...
The layout versus schematic (LVS) analysis is an essential part of topology design verification, and...
This work focuses on the usage of dominators in circuit graphs in order to reduce the complexity of ...
The development of a theoretical basis for a technology-independent, false-error free, hierarchical ...
The problem of finding meaningful subcircuits in a logic layout appears in many contexts in computer...
This paper presents a new approach to layout-to-circuit extraction for bipolar and BiC-MOS technolog...
Abstract—A new graph reduction approach to symbolic circuit analysis is developed in this paper. A B...
A transistor level representation for VLSI circuits is presented. This representation is simple but ...