Hierarchical Layout Verification

This article presents a hierarchical cell structure that has been Used successfully to improve the performance of Intel's connectivity verifier and design rule checker. A unique algorithm for performing design rule checks efficiently in a hierarchical environment is discussed in detail. To undersize and oversize in a hierarchical environment without disrupting the cell structure, the definition of sizing must be changed so that geometries inside a cell and touching the cell boundaries do not pull away and geometries outside the cell do not extend inside. There are also a few Pathologies¿caused mostly by looking at only a small portion of the layout, outside of the context where it is used. Nevertheless, careful use of hierarchical design can deliver order-of-magnitude improvements in layout checking runtime.

[1]  Gary M. Tarolli,et al.  Hierarchical Circuit Extraction with Detailed Parasitic Capacitance , 1983, 20th Design Automation Conference Proceedings.

[2]  L. V. Corbin Custom VLSI Electrical Rule Checking in an Intelligent Terminal , 1981, 18th Design Automation Conference.

[3]  Anoop Gupta ACE: A Circuit Extractor , 1983, 20th Design Automation Conference Proceedings.

[4]  John K. Ousterhout,et al.  Lyra: A New Approach to Geometric Layout Rule Checking , 1982, DAC 1982.

[5]  Makoto Takashima,et al.  Programs for Verifying Circuit Connectivity of MOS/LSI Mask Artwork , 1982, DAC 1982.

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

[7]  William A. Johnson,et al.  Mixed-level simulation from a hierarchical CHDL , 1980, SIGD.

[8]  Laurin Williams Automatic VLSI Layout Verification , 1981, 18th Design Automation Conference.