Abstract We explore a method for quickly generating optimal CMOS functional circuits. The method is based upon an algebra we have derived that describes the composition of parallel-series graphs and their duals simultaneously , and as such, exactly describes the layout of CMOS functional circuits. The method is constructive; it creates the smallest components first, putting them together until the final circuit is realized. The constructed layout is representative of an unordered tree traversal, and is generated in time proportional to the number of input signals. After describing the required concepts from graph theory and CMOS layout practices, we introduce an alternative symbolism for describing parallel-series graphs. We develop, with these symbols, a composition algebra, and demonstrate that the properties in the alternative domain hold in the original. We then use the algebra to implement a linear-time algorithm for generating CMOS functional cells.
[1]
John H. Reif.
VLSI Algorithms and Architectures
,
1988
.
[2]
Alfred V. Aho,et al.
Principles of compiler construction
,
1977
.
[3]
Thomas Lengauer,et al.
Linear Algorithms For Two CMOS Layout Problems
,
1986,
Aegean Workshop on Computing.
[4]
Saburo Muroga,et al.
VLSI system design
,
1982
.
[5]
Neil Weste,et al.
Principles of CMOS VLSI Design
,
1985
.
[6]
T. Lengauer,et al.
Linear algorithms for optimizing the layout of dynamic CMOS cells
,
1988
.
[7]
J. Taylor,et al.
Switching and finite automata theory, 2nd ed.
,
1980,
Proceedings of the IEEE.
[8]
I. Herstein,et al.
Topics in algebra
,
1964
.
[9]
Takao Uehara,et al.
Optimal Layout of CMOS Functional Arrays
,
1978,
16th Design Automation Conference.