A novel graph algorithm for circuit recognition

This paper presents novel subcircuit recognition and verification algorithms based on a new technique for circuit graph coding. This coding uniquely identifies each subcircuit and is ideal for applications requiring circuit graph isomorphism in the presence of parasitics. These algorithms use a new circuit graph and graph isomorphism techniques to generate a unique code for each subcircuit, which has led to an improved circuit recognition algorithm.

[1]  K.L. Kodandapani,et al.  A Wirelist Compare Program for Verifying VLSI Layouts , 1986, IEEE Design & Test of Computers.

[2]  George I. Davida,et al.  Optimum Featurs and Graph Isomorphism , 1974, IEEE Trans. Syst. Man Cybern..

[3]  Resve Saleh,et al.  Automatic Partitioning And Dynamic Mixed-mode Simulation , 1992, 1992 Proceedings of the IEEE Custom Integrated Circuits Conference.

[4]  Jonathan Allen,et al.  Macromodeling CMOS circuits for timing simulation , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[5]  I. Ablasser,et al.  Circuit Recognition and Verification Based on Layout Information , 1981, 18th Design Automation Conference.

[6]  M. Miyama,et al.  A new circuit recognition and reduction method for pattern based circuit simulation , 1990, IEEE Proceedings of the Custom Integrated Circuits Conference.

[7]  David G. Kirkpatrick,et al.  A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem , 1980, SIAM J. Comput..