C. Visweswariah
ABSTRACT
Variability in digital integrated circuits makes timing verification an extremely challenging task. In this paper, a canonical first order delay model is proposed that takes into account both correlated and independent randomness. A novel linear-time block-based statistical timing algorithm is employed to propagate timing quantities like arrival times and required arrival times through the timing graph in this canonical form. At the end of the statistical timing, the sensitivities of all timing quantities to each of the sources of variation are available. Excessive sensitivities can then be targeted by manual or automatic optimization methods to improve the robustness of the design. This paper also reports the first incremental statistical timer in the literature which is suitable for use in the inner loop of physical synthesis or other optimization programs. The third novel contribution of this paper is the computation of local and global criticality probabilities. For a very small cost in CPU time, the probability of each edge or node of the timing graph being critical is computed. Numerical results are presented on industrial ASIC chips with over two million logic gates.
- C. Visweswariah, "Death, taxes and failing chips," Proc. 2003 Design Automation Conference, pp. 343--347, June 2003. Anaheim, CA. Google Scholar
Digital Library
- R. P. Abato, A. D. Drumm, D. J. Hathaway, and L. P. P. P. van Ginneken, "Incremental timing analysis," U. S. Patent 5,508,937, April 1993.Google Scholar
- J.-J. Liou, K.-T. Cheng, S. Kundu, and A. Krstic, "Fast statistical timing analysis by probabilistic event propagation," Proc. 2001 Design Automation Conference, pp. 661--666, June 2001. Las Vegas, NV. Google ScholarDigital Library
- M. R. C. M. Berkelaar, "Statistical delay calculation: a linear time method," Proc. TAU (ACM/IEEE workshop on timing issues in the specification and synthesis of digital systems), December 1997.Google Scholar
- A. B. Agarwal, D. Blaauw, V. Zolotov, and S. Vrudhula, "Computation and refinement of statistical bounds on circuit delay," Proc. 2003 Design Automation Conference, June 2003. Anaheim, CA. Google ScholarDigital Library
- L. Scheffer, "Explicit computation of performance as a function of process variation," Proc. TAU (ACM/IEEE workshop on timing issues in the specification and synthesis of digital systems), pp. 1--8, December 2002. Monterey, CA. Google ScholarDigital Library
- H. Chang and S. S. Sapatnekar, "Statistical timing analysis considering spatial correlations using a single PERT-like traversal," IEEE International Conference on Computer-Aided Design, pp. 621--625, November 2003. San Jose, CA. Google ScholarDigital Library
- A. Agarwal, D. Blaauw, and V. Zolotov, "Statistical timing analysis for intra-die process variations with spatial correlations," IEEE International Conference on Computer-Aided Design, pp. 900--907, November 2003. San Jose, CA. Google ScholarDigital Library
- J. Jess, "Dfm in synthesis," research report, IBM Research Division, T. J. Watson Research Center, Yorktown Heights, NY 10598, December 2001.Google Scholar
- J. A. G. Jess, K. Kalafala, S. R. Naidu, R. H. J. M. Otten, and C. Visweswariah, "Statistical timing for parametric yield prediction of digital integrated circuits," Proc. 2003 Design Automation Conference, pp. 932--937, June 2003. Anaheim, CA. Google ScholarDigital Library
- C. E. Clark, "The greatest of a finite set of random variables," Operations Research, pp. 145--162, March-April 1961.Google ScholarDigital Library
- M. Cain, "The moment-generating function of the minimum of bivariate normal random variables," The American Statistician, vol. 48, pp. 124--125, May 1994.Google Scholar
- C. Visweswariah, "System and method for statistical timing analysis of digital circuits," Docket YOR9-2003-401, August 2003. Filed with the U. S. Patent office.Google Scholar
- C. Visweswariah, "System and method for probabilistic criticality prediction of digital circuits," Docket YOR9-2003-402, August 2003. Filed with the U. S. Patent office.Google Scholar
- D. J. Hathaway, J. P. Alvarez, and K. P. Belkhale, "Network timing analysis method which eliminates timing variations between signals traversing a common circuit path," U. S. Patent 5,636,372, June 1997.Google Scholar
- C. Visweswariah, "System and method for incremental statistical timing analysis of digital circuits," Docket YOR9-2003-403, August 2003. Filed with the U. S. Patent office.Google Scholar
Index Terms
- First-order incremental block-based statistical timing analysis
Recommendations
First-Order Incremental Block-Based Statistical Timing Analysis
Variability in digital integrated circuits makes timing verification an extremely challenging task. In this paper, a canonical first-order delay model that takes into account both correlated and independent randomness is proposed. A novel linear-time ...
Timing analysis with nonseparable statistical and deterministic variations
DAC '12: Proceedings of the 49th Annual Design Automation ConferenceStatistical static timing analysis (SSTA) is ideal for random variations but is not suitable for environmental variations like Vdd and temperature. SSTA uses statistical approximation, according to which circuit timing is predicted accurately only for ...
Practical statistical static timing analysis with current source models
DAC '16: Proceedings of the 53rd Annual Design Automation ConferenceThis paper considers the practical nuances of using current source gate models in an industrial statistical timing analysis environment. Specifically, the memory overhead of a naive implementation combining statistical and current source models to ...
Comments