Using a multiple storage quad tree on a hierarchical VLSI compaction scheme

A graph-generating algorithm and the experimental results of a hierarchical mask-layout-compaction scheme based on a plane-sweep algorithm, a fast region-query and a space-efficient data structure called the hierarchical multiple-storage quad tree are presented. For a mask-layout design, a rectangle is used as the primary element of the layout. Hence, in the hierarchical mask-compaction scheme, the graph-generating algorithm is based on the edges of rectangles rather than the central lines of symbols for the symbolic-compaction design. The plane-sweep algorithm is also called a dynamic event scheduling algorithm and can be applied to solve some other problems in the field of computational geometry and image processing. The efficiencies of the plane-sweep algorithm and the graph-generating algorithm are dependent on the region-query operations of the spatial data structure. By using the improved multiple storage quad tree as the spatial data structure in the system, the mask-layout compactor has been accomplished in a practically linear time performance in terms of the rectangles in the source layout. >

[1]  Jonathan Allen,et al.  Minplex - A Compactor that Minimizes the Bounding Rectangle and Individual Rectangles in a Layout , 1986, DAC 1986.

[2]  Alberto Sangiovanni-Vincentelli,et al.  Two-Dimensional Compaction by 'Zone Refining' , 1986, DAC 1986.

[3]  Jin-fuw Lee.  A new framework of design rules for compaction of VLSI layouts , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  Werner L. Schiele.  Automatic design rule adaptation of leaf cell layouts , 1985, Integr..

[5]  Stephen Daniel,et al.  A Fully Automatic Hierarchical Compactor , 1985, DAC 1985.

[6]  Hanan Samet,et al.  An Algorithm for Converting Rasters to Quadtrees , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Kjell O. Jeppson,et al.  New algorithms for increased efficiency in hierarchical design rule checking , 1987, Integr..

[8]  Jin-fuw Lee,et al.  VLSI Layout Compaction with Grid and Mixed Constraints , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[9]  Jon Louis Bentley,et al.  Data Structures for Range Searching , 1979, CSUR.

[10]  Werner L. Schiele.  Improved Compaction by Minimized Length of Wires , 1983, 20th Design Automation Conference Proceedings.

[11]  Randy Lee Brown.  Multiple Storage Quad Trees: A Simpler Faster Alternative to Bisector List Quad Trees , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[12]  Hanan Samet,et al.  Region representation: quadtrees from boundary codes , 1980, CACM.

[13]  Wu-Shiung Feng,et al.  An edge-oriented compaction scheme based on multiple storage quad tree , 1988, 1988., IEEE International Symposium on Circuits and Systems.

[14]  Vishwani D. Agrawal,et al.  Chip Layout Optimization Using Critical Path Weighting , 1984, 21st Design Automation Conference Proceedings.

[15]  Hosaker N. Mahabala,et al.  A New Compaction Scheme Based on Compression Ridges , 1987, 24th ACM/IEEE Design Automation Conference.

[16]  Lalit M. Patnaik,et al.  Algorithm for incremental compaction of geometrical layouts , 1987 .

[17]  I. V. Ramakrishnan,et al.  Dual Quadtree Representation for VLSI Designs , 1986, DAC 1986.

[18]  Chak-Kuen Wong,et al.  An Algorithm to Compact a VLSI Symbolic Layout with Mixed Constraints , 1983, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[19]  Thomas Lengauer,et al.  Algorithmic Aspects of One-Dimensional Layout Compaction , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[20]  Lalit M. Patnaik,et al.  Linear time geometrical design rule checker based on quadtree representation of VLSI mask layouts , 1986 .

[21]  Hanan Samet,et al.  The Quadtree and Related Hierarchical Data Structures , 1984, CSUR.

[22]  Gershon Kedem,et al.  The quad-cif tree a data structure for h , 1981, DAC 1982.

[23]  Hanan Samet,et al.  Distance Transform for Images Represented by Quadtrees , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[24]  John K. Ousterhout,et al.  Corner Stitching: A Data-Structuring Technique for VLSI Layout Tools , 1984, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[25]  Chi-Yuan Lo.  Automatic Tub Region Generation for Symbolic Layout Compaction , 1989, 26th ACM/IEEE Design Automation Conference.

[26]  Christopher Kingsley.  A Hiererachical, Error-Tolerant Compactor , 1984, 21st Design Automation Conference Proceedings.

[27]  Jonathan B. Rosenberg,et al.  Geographical Data Structures Compared: A Study of Data Structures Supporting Region Queries , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[28]  Hiroyuki Watanabe,et al.  Graph-Optimization Techniques for IC Layout and Compaction , 1983, 20th Design Automation Conference Proceedings.