Gate-size selection for standard cell libraries
Frederik Beeftink, Prabhakar N. Kudva, David S. Kung, Leon Stok · 1998
This paper presents an algorithm to select a good set of gate sizes for the primitive gates of a standard cell library. A measurement error on a gate is dened to quantify the discrepancy resulting from replacing the size required by a synthesis sizing algorithm with a size available in a discrete cell library. The criterion for gate size selection is a set of gate sizes that minimizes the cumulative error of a prescribed measurement. Optimal solutions to the gate size selection problem targetting size and delay measurements are presented for cases when the probability distribution and the delay equations are simple. A realistic probability distribution is obtained using a sample space of gates derived fromagroup of designs that is synthesized under the semi-custom synthesis methodology [1]. A \\delay-match " (minimizing delay error) and a \\sizematch" (minimizing size error) set of gate sizes are obtained numerically, and are subsequently realized as discrete cell libraries. The previous group of designs are synthesized using the two selected cell libraries and two other cell libraries, one with \\equal-spacing " of cell sizes and the other with \\exponential-spacing " of cell sizes. The \\size-match " library gives the best overall slack and area results. 1