Azadeh Davoodi
ABSTRACT
Process variations result in a considerable spread in the frequency of the fabricated chips. In high performance applications, those chips that fail to meet the nominal frequency after fabrication are either discarded or sold at a loss which is typically proportional to the degree of timing violation. The latter is called binning. In this paper we present a gate sizing-based algorithm that optimally minimizes the binning yield-loss. We make the following contributions: 1) prove the binning yield function to be convex, 2) do not make any assumptions about the sources of variability, and their distribution model, 3) we integrate our strategy with statistical timing analysis tools (STA), without making any assumptions about how STA is done, 4) if the objective is to optimize the traditional yield (and not binning yield) our approach can still optimize the same to a very large extent. Comparison of our approach with sensitivity-based approaches under fabrication variability shows an improvement of on average 72% in the binning yield-loss with an area overhead of an average 6%, while achieving a 2.69 times speedup under a stringent timing constraint. Moreover we show that a worst-case deterministic approach fails to generate a solution for certain delay constraints. We also show that optimizing the binning yield-loss minimizes the traditional yield-loss with a 61% improvement from a sensitivity-based approach.
- A. Agrawal, K. Chopra, D. Blaauw, and V. Zolotov. Circuit Optimization Using Statistical Static Timing Analysis. In DAC, pages 338--342, 2005.Google Scholar
Digital Library
- A. Raychowdhury, S. Ghosh, and K. Roy. A Novel On-chip Delay Measurement Hardware for Efficient Speed-Binning. In IOLTS, July 2005. Google ScholarDigital Library
- C. Visweswariah , K. Ravindran , K. Kalafala , S. G. Walker , and S. Narayan. First-Order Incremental Block-Based Statistical Timing Analysis. In DAC, 2004. Google ScholarDigital Library
- D. Sinha, N. V. Shenoy, and H. Zhou. Statistical Gate Sizing for Timing Yield Optimization. In ICCAD, Nov. 2005. Google ScholarDigital Library
- H. Chang, V. Zolotov, S. Narayan, and C. Visweswariah. Parameterized Block-Based Statistical Timing Analysis with Non-Gaussian Parameters and Nonlinear Delay Functions. In DAC, 2005. Google ScholarDigital Library
- http://www.mosek.com.Google Scholar
- J. Fishburn and A. Dunlop. TILOS: A Posynomial Programming Approach to Transistor Sizing. In ICCAD, pages 326--328, 1985.Google Scholar
- J. Singh, V. Nookala, Z. Luo, and S. Sapatnekar. Robust Gate Sizing by Geometric Programming. In DAC, pages 315--320, July 2005. Google ScholarDigital Library
- Jan M. Rabaey, Anantha Chandrakasan, and Borivoje Nikolić. Digital Integrated Circuits. Prentice Hall. Google ScholarDigital Library
- K. Chopra, S. Shah, A, Srivastava, David Blaauw, and D. Sylvester. Parameteric Yield Maximization using Gate Sizing based on Efficient Statistical Power and Delay Gradient Computation. In ICCAD, Nov. 2004. Google ScholarDigital Library
- M. Mani, A. Devgana, and M. Orshansky. An Efficient Algorithm for Statistical Minimization of Total Power under Timing Yield Constraints. In DAC, July 2005. Google ScholarDigital Library
- M. R. Guthaus, N. Venkateswaran, C. Visweswariah, and V. Zolotov. Gate Sizing Using Incremental Parameterized Statistical Timing Analysis. In ICCAD, Nov. 2005. Google ScholarDigital Library
- R. J-B Wets. Stochastic Programs with Fixed Recourse: The Equivalent Deterministic Program. In SIAM Review, pages 309--339, July 1974.Google ScholarCross Ref
- S. Bhardwaj, S. B. K. Vrdhula. Leakage Minimization of Nano-scale Circuits in the Presence of Systematic and Random Variations. In ICCAD, Nov. 2005. Google ScholarDigital Library
- S. Borkar, T. Karnik, S. Narendra, J. Tschanz, A. Keshavarzi, V. De. Parameter Variations and Impacts on Circuits and Microarchitecture. In DAC, 2003. Google ScholarDigital Library
- S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge 2004. Google ScholarDigital Library
- S. Sapatnekar, V. B. Rao, P.M. Vaidya, and S. M. Kang. An Exact Solution to the Transistor Sizing Problem for CMOS Circuits Using Convex Optimization. In IEEE Transactions on CAD, pages 1621--1634, Nov. 1993.Google Scholar
- V. Khandelwal, A. Srivastava. A General Framework for Accurate Statistical Timing Analysis Considering Correlations. In DAC, 2005. Google ScholarDigital Library
- Y. Cao, T. Sato, D. Sylvester, M. Orshansky, and C. Hu. New paradigm of predictive MOSFET and interconnect modeling for early circuit design. In Proc. of CICC, 2000.Google Scholar
Index Terms
- Variability driven gate sizing for binning yield optimization
Recommendations
Variability driven gate sizing for binning yield optimization
High performance applications are highly affected by process variations due to considerable spread in their expected frequencies after fabrication. Typically "binning" is applied to those chips that are not meeting their performance requirement after ...
Gate sizing: finFETs vs 32nm bulk MOSFETs
DAC '06: Proceedings of the 43rd annual Design Automation ConferenceFinFET devices promise to replace traditional MOSFETs because of superior ability in controlling leakage and minimizing short channel effects while delivering a strong drive current. We investigate in this paper gate sizing of finFET devices, and we ...
NBTI tolerance and leakage reduction using gate sizing
Leakage power is a major design constraint in deep submicron technology and below. Meanwhile, transistor degradation due to Negative Bias Temperature Instability (NBTI) has emerged as one of the main reliability concerns in nanoscale technology. Gate ...
Comments