A method for analog circuits visualization

Author

Arsintescu, Bogdan G.

Author_Institution

Delft Univ. of Technol., Netherlands

fYear

1996

fDate

7-9 Oct 1996

Firstpage

454

Lastpage

459

Abstract

A method for the visualization of an analog circuit starting from a netlist is described in this paper. The images obtained have a comprehensible form, symmetrical structures and other analog topological patterns being discovered in the circuit netlist. The method is based on two algorithms. The first one, the symmetry algorithm, exploits the possibility of extracting topology information from a graph representation of the circuit. The second one performs a grid expansion on a directed graph structure, using the results of the symmetry algorithm. The method has been implemented in the “A-warD” program. Test-cases demonstrate the effectiveness of the method

Keywords

analogue integrated circuits; circuit CAD; circuit diagrams; data visualisation; directed graphs; A-warD program; algorithms; analog circuit visualization; analog topological patterns; circuit diagrams; circuit netlist; directed graph structure; grid expansion; symmetrical structures; symmetry algorithm; test-cases; topology information; Analog circuits; Analog integrated circuits; Bipolar transistor circuits; Capacitance; Circuit testing; Circuit topology; Debugging; Design methodology; Integrated circuit layout; Visualization;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Design: VLSI in Computers and Processors, 1996. ICCD '96. Proceedings., 1996 IEEE International Conference on

Conference_Location

Austin, TX

ISSN

1063-6404

Print_ISBN

0-8186-7554-3

Type

conf

DOI

10.1109/ICCD.1996.563593

Filename

563593