Automatic Layout Synthesis of Leaf Cells

This paper describes algorithms for automatic layout synthesis of leaf cells in 1-d and in a new 1-1/2-d layout style, useful for non-dual circuit styles. The graph theory based algorithms use concepts set forth by Euler and Hamilton to achieve two tasks. The transistor placement algorithm uses the Euler's theorem, while the placement of the groups of the transistors is achieved by using Hamiltonian graphs. Results show that the algorithms produce extremely competent layouts when compared to other algorithms in the literature and manual layouts.

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

[2]  Chi-Yuan Lo,et al.  GENAC: An Automatic Cell Synthesis Tool , 1989, 26th ACM/IEEE Design Automation Conference.

[3]  Charles J. Poirier.  Excellerator: custom CMOS leaf cell layout generator , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  P. W. Kollaritsch,et al.  TOPOLOGIZER: An Expert System Translator of Transistor Connectivity to Symbolic Cell Layout , 1984, ESSCIRC '84: Tenth European Solid-State Circuits Conference.

[5]  John P. Hayes,et al.  Layout Minimization of CMOS Cells , 1991 .

[6]  C. C. Chen,et al.  The Layout Synthesizer: An Automatic Netlist-to-Layout System , 1989, 26th ACM/IEEE Design Automation Conference.

[7]  Takao Uehara,et al.  Optimal Layout of CMOS Functional Arrays , 1978, 16th Design Automation Conference.

[8]  Donald G. Baltus,et al.  SOLO: a generator of efficient layouts from optimized MOS circuit schematics , 1988, DAC '88.

[9]  Jan Madsen.  A new approach to optimal cell synthesis , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[10]  Yu-Chin Hsu,et al.  An efficient layout style for two-metal CMOS leaf cells and its automatic synthesis , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[11]  Xin He,et al.  Minimum area layout of series-parallel transistor networks is NP-hard , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..