About this Journal Submit a Manuscript Table of Contents
VLSI Design
Volume 10 (1999), Issue 1, Pages 117-125
http://dx.doi.org/10.1155/1999/50892

Hierarchy Restructuring for Hierarchical LVS Comparison

Dept. of Electronics Eng., Hanyang University, Kyungki, S. Korea, Ansan 425-791, Korea

Received 7 September 1998; Accepted 20 November 1998

Copyright © 1999 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

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.