Combinatorial cell design for CMOS libraries

✍ Scribed by Frederik Beeftink; Prabhakar Kudva; David S. Kung; Ruchir Puri; Leon Stok

• Publisher: Elsevier Science
• Year: 2000
• Tongue: English
• Weight: 611 KB
• Volume: 29
• Category: Article
• ISSN: 0167-9260
• DOI: 10.1016/s0167-9260(99)00024-3

✦ Synopsis

This paper presents a methodology for designing primitive gates in a CMOS standard cell library. The topological design space of the gates is restricted to varying the p-to n-fet width ratio and the optimal ratio is determined analytically. With topology thus "xed, gate size selection is performed as follows. A measurement error on a gate is de"ned 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 targeting size and delay measurements are presented for cases where 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. A delay-matcha (minimizing delay error) and a size-matcha (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 equalspacinga of cell sizes and the other with exponential-spacinga of cell sizes. The `size-matcha library gives the best overall slack and area results.