An O(n) algorithm for transistor stacking with performance constraints

We describe a new constraint-driven stacking algorithm for diffusion area minimization of CMOS circuits. It employs an Eulerian trail finding algorithm that can satisfy analog-specific performance constraints. Our technique is superior to other published approaches both ill terms of its time complexity and in the optimality of the stacks it produces. For a circuit with n transistors. The time complexity is O(n). All performance constraints are satisfied and, for a certain class of circuits, optimum stacking is guaranteed.

[1]  E. Charbon,et al.  A Constraint-driven Placement Methodology For Analog Integrated Circuits , 1992, 1992 Proceedings of the IEEE Custom Integrated Circuits Conference.

[2]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[3]  R.A. Rutenbar,et al.  An O(n) algorithm for transistor stacking with performance constraints , 1996, 33rd Design Automation Conference Proceedings, 1996.

[4]  E. Charbon,et al.  Generalized constraint generation for analog circuit design , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[5]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[6]  S. Chakravarty,et al.  On optimizing nMOS and dynamic CMOS functional cells , 1990, IEEE International Symposium on Circuits and Systems.

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

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

[9]  Rob A. Rutenbar,et al.  KOAN/ANAGRAM II: new tools for device-level analog placement and routing , 1991 .

[10]  Uehara,et al.  Optimal Layout of CMOS Functional Arrays , 1981 .

[11]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[12]  Rob A. Rutenbar,et al.  Efficient area minimization for dynamic CMOS circuits , 1996, Proceedings of Custom Integrated Circuits Conference.

[13]  Alberto L. Sangiovanni-Vincentelli,et al.  Simultaneous Placement and Module Optimization of Analog IC's , 1994, 31st Design Automation Conference.

[14]  Rob A. Rutenbar,et al.  Latchup-aware placement and parasitic-bounded routing of custom analog cells , 1993, ICCAD '93.

[15]  Davide Pandini,et al.  Optimum CMOS stack generation with analog constraints , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[16]  Marcel J. M. Pelgrom,et al.  Matching properties of MOS transistors , 1989 .

[17]  Alberto L. Sangiovanni-Vincentelli,et al.  Automatic generation of parasitic constraints for performance-constrained physical design of analog circuits , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

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