A New Statistical Optimization Algorithm for Gate Sizing

— In this paper, we approach the gate sizing problem in VLSI circuits in the context of increasing variability of process and circuit parameters as technology scales into the nanometer regime. We present a statistical sizing approach that takes into account randomness in gate delays by formulating a robust linear program that can be solved efficiently. We demonstrate the efficiency and computational tractability of the proposed algorithm on the various ISCAS’85 benchmark circuits. Across the benchmarks, compared to the deterministic approach, the power savings range from 23 − 30% for the same timing target and the yield level, the average power saving being 28%. The runtime is reasonable, ranging from a few seconds to around 10 mins, and grows linearly.

• Type: Conference
• Year: 2004
• Where: ICCD
• Authors: Murari Mani, Michael Orshansky
• Keywords: Deterministic Approach, Gate Sizing Problem, Hardware, ICCD 2004, Statistical Sizing Approach