Gate-size selection for standard cell libraries

被引:23
作者
Beeftink, F [1 ]
Kudva, P [1 ]
Kung, D [1 ]
Stok, L [1 ]
机构
[1] Delft Univ Technol, NL-2628 CD Delft, Netherlands
来源
1998 IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN: DIGEST OF TECHNICAL PAPERS | 1998年
关键词
D O I
10.1109/ICCAD.1998.743051
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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 defined 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 from a group of designs that is synthesized under the semi-custom synthesis methodology [1] A "delay-match" (minimizing delay error) and a "size-match" (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.
引用
收藏
页码:545 / 550
页数:6
相关论文
empty
未找到相关数据