A Subjective Review of Compaction

Compaction is the CAD tool used to pack rough sketches or symbolic diagrams to produce IC layouts. Manual compaction is tedious, time-consuming, and error-prone; automated compaction tools can greatly shorten the layout design cycle. This paper reviews the historical background and the major developments in the field of compaction, emphasizing subjective evaluations rather than objective descriptions. The major approaches covered are constraint-graph, shear-line, and virtual-grid. Various ideas for further reducing chip area (such as inserting jog points, shortening wires, dense packing, 2-D compaction, and interactive tools) are also discussed. Because of the critical role of efficient algorithms in VLSI CAD systems, analyses of computational complexities are also included.

[1]  Chak-Kuen Wong,et al.  An Algorithm to Compact a VLSI Symbolic Layout with Mixed Constraints , 1983, 20th Design Automation Conference Proceedings.

[2]  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.

[3]  Sheldon B. Akers,et al.  IC mask layout with a single conductor layer , 1970, DAC '70.

[4]  David Maier,et al.  An Efficient Method for Storing Ancestor Information in Trees , 1979, SIAM J. Comput..

[5]  Charles H. Ng.  A Symbolic-Interconnect Router for Custom IC Design , 1984, 21st Design Automation Conference Proceedings.

[6]  Jeffrey D Ullma.  Computational Aspects of VLSI , 1984 .

[7]  Dieter A. Mlynski,et al.  Automatic Variable-Width Routing for VLSI , 1983, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[8]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[9]  Ulrich Lauther,et al.  A Min-Cut Placement Algorithm for General Cell Assemblies Based on a Graph Representation , 1979, 16th Design Automation Conference.

[10]  John A. Newkirk,et al.  A Target Language for Silicon Compilers , 1982, COMPCON.

[11]  Elsayed A. Elsayed,et al.  Layout aid for the design of VLSI circuits , 1981 .

[12]  Henry S. Baird.  Fast algorithms for LSI artwork analysis , 1977, DAC '77.

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

[14]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[15]  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.

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

[17]  Wayne Wolf,et al.  Two-dimensional compaction strategies , 1984 .

[18]  R. C. Mosteller.  REST: A Leaf Cell Design System , 1981 .

[19]  Henry S. Baird,et al.  An artwork design verification system , 1975, DAC '75.

[20]  Hajimu Mori.  Interactive Compaction Router for VLSI Layout , 1984, 21st Design Automation Conference Proceedings.

[21]  Christopher J. Van Wyk,et al.  Space Efficient Algorithms for VLSI Artwork Analysis , 1983, 20th Design Automation Conference Proceedings.

[22]  Alfred E. Dunlop.  SLIP: symbolic layout of integrated circuits with compaction , 1978 .

[23]  N. S. Barnett,et al.  Private communication , 1969 .

[24]  Mikhail Lotvin,et al.  AMOEBA: A Symbolic VLSI Layout System , 1984, 21st Design Automation Conference Proceedings.

[25]  Walter S. Scott,et al.  Plowing: Interactive Stretching and Compaction in Magic , 1984, 21st Design Automation Conference Proceedings.

[26]  Chak-Kuen Wong,et al.  An algorithm for optimal two-dimensional compaction of VLSI layouts , 1983, Integr..

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

[28]  M. Y. Hsueh,et al.  Symbolic layout and compaction of integrated circuits , 1980 .