Fanout optimization under a submicron transistor-level delay model

In this paper we present a new fanout optimization algorithm which is particularly suitable for digital circuits designed with submicron CMOS technologies. Restricting the class of fanout trees to the so-called bipolar LT-trees, the topology of the optimal fanout tree is found by means of a dynamic programming algorithm. The bu er selection is in turn performed by using a continuous bu er sizing technique based on a very accurate delay model especially developed for submicron CMOS processes. The fanout trees can distribute a signal with arbitrary polarity from the root of the tree to a set of sinks with arbitrary required time, required minimum signal slope, polarity and capacitive load. These trees can be constructed to maximize the required time at the root or to minimize the total bu er area under a required time constraint at the root. The performance of the algorithm shows several improvements with respect to conventional fanout optimization methods. More precisely, the area and ...

• Type: Conference
• Year: 1998
• Where: ICCAD
• Authors: Pasquale Cocchini, Massoud Pedram, Gianluca Piccinini, Maurizio Zamboni
• Keywords: Bu Er, Fanout Trees, Hardware, ICCAD 1998, Required Time