A performance-aimed cell compactor with automatic jogs

To develop an efficient cell compactor for practical use, the authors take the one-dimensional compaction approach, but with a mixed symbolic and shape data model. A new algorithm of automatic jog generation is employed to create jogs, not only on critical paths but also on some noncritical paths. An optimum wire length minimization algorithm is used to tighten wires and polygon edges. These algorithms help reduce both the cell size and the parasitic, and hence produce high-quality layouts. The compactor has been used at IBM in the production of several standard cell libraries and macrocells,. >

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

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

[3]  Yuh-Zen Liao,et al.  PSI: A Symbolic Layout System , 1984, IBM J. Res. Dev..

[4]  Ernest S. Kuh,et al.  Nutcracker: An Efficient and Intelligent Channel Spacer , 1987, 24th ACM/IEEE Design Automation Conference.

[5]  Ernest S. Kuh,et al.  Glitter: A Gridless Variable-Width Channel Router , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

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

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

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

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

[10]  Jin-fuw Lee.  A layout compaction algorithm with multiple grid constraints , 1991, [1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors.

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

[12]  Ron Y. Pinter,et al.  Optimal Chaining of CMOS Transistors in a Functional Cell , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

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

[14]  David N. Deutsch.  A “DOGLEG” channel router , 1976, DAC 1976.

[15]  Stephen D. Posluszny.  SLS: An Advanced Symbolic Layout System for Bipolar and FET Design , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

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

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

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