Hierarchy Restructuring for Hierarchical LVS Comparison

A new hierarchical layout vs. schematic (LVS) comparison system for layout verification has been developed. The schematic hierarchy is restructured to remove ambiguities for consistent hierarchical matching. Then the circuit hierarchy is reconstructed from the layout netlist by using a modified SubGemini algorithm recursively in bottom-up fashion. For efficiency, simple gates are found by using a fast rule-based pattern matching algorithm during preprocessing. Experimental results show that our hierarchical netlist comparison technique is effective and efficient in CPU time and in memory usage, especially when the circuit is large and hierarchically structured.

[1]  Wray L. Buntine,et al.  Automatic circuit analysis based on mask information , 1976, DAC '76.

[2]  Carl Ebeling.  GeminiII: a second generation layout validation program , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

[3]  G. Pelz,et al.  Pattern matching and refinement hybrid approach to circuit comparison , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  Magdy S. Abadir,et al.  An improved layout verification algorithm (LAVA) , 1990, Proceedings of the European Design Automation Conference, 1990., EDAC..

[5]  D. Overhauser,et al.  Full-chip verification of UDSM designs , 1998, ICCAD '98.

[6]  Carl Ebeling,et al.  SubGemini: Identifying SubCircuits using a Fast Subgraph Isomorphism Algorithm , 1993, 30th ACM/IEEE Design Automation Conference.

[7]  Pradeep Batra,et al.  Hcompare: a hierarchical netlist comparison program , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[8]  Mike Spreitzer.  Comparing structurally different views of a VLSI design , 1991, DAC '90.

[9]  Erich Barke.  A Network Comparison Algorithm for Layout Verification of Integrated Circuits , 1984, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.