Optimal ordering of gate signals in CMOS complex gates

Abstract

A heuristic approach for optimizing CMOS layouts, based on a graph-theoretical framework, is described. The method produces optimal chains of transistors while minimizing the number of metal tracks required for the implementation of internal interconnect. Some common restrictions imposed by other systems are relaxed or removed to produce more compact layouts