A methodology to improve timing yield in the presence of process variations

ABSTRACT

The ability to control the variations in IC fabrication process is rapidly diminishing as feature sizes continue towards the sub-100 nm regime. As a result, there is an increasing uncertainty in the performance of CMOS circuits. Accounting for the worst case values of all parameters will result in an unacceptably low timing yield. Design for Variability, which involves designing to achieve a given level of confidence in the performance of ICs, is fast becoming an indispensable part of IC design methodology. This paper describes a method to identify certain paths in the circuit that are responsible for the spread of timing performance. The method is based on defining a disutility function of the gate and path delays, which includes both the means and variances of the delay random variables. Based on the moments of this disutility function, an algorithm is presented which selects a subset of paths (called undominated paths) as being most responsible for the variation in timing performance. Next, a statistical gate sizing algorithm is presented, which is aimed at minimizing the delay variability of the nodes in the selected paths subject to constraints on the critical path delay and the area penalty. Monte-Carlo simulations with ISCAS '85 benchmark circuits show that our statistical optimization approach results in significant improvements in timing yield over traditional deterministic sizing methods.

REFERENCES

• 1: Aseem Agarwal , David Blaauw , Vladimir Zolotov , Sarma Vrudhula, Statistical timing analysis using bounds and selective enumeration, Proceedings of the 8th ACM/IEEE international workshop on Timing issues in the specification and synthesis of digital systems, December 02-03, 2002, Monterey, California, USA [doi>10.1145/589411.589415]
• 2: Sarvesh Bhardwaj , Sarma B. K. Vrudhula , David Blaauw, "AU: Timing Analysis Under Uncertainty, Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design, p.615, November 09-13, 2003 [doi>10.1109/ICCAD.2003.1]
• 3: Anantha P. Chandrakasan , William J. Bowhill , Frank Fox, Design of High-Performance Microprocessor Circuits, Wiley-IEEE Press, 2000
• 4: R. B. Brashear, N. Menezes C. Oh, L.T. Pillage, M.R. Mercer. Predicting circuit performance using circuit-level statistical timing analysis. European Design and Test Conf., Mar 2002.
• 5: A. R. Conn , N. I. M. Gould , Ph L. Toint, Lancelot: A FORTRAN Package for Large-Scale Nonlinear Optimization (Release A), Springer-Verlag New York, Inc., Secaucus, NJ, 1992
• 6: S. E. Elmaghraby. Activity Networks: Project Planning and Control by Network Models. John Wiley & Sons, 1977.
• 7: J. Fishburn, A. Dunlop. TILOS: A Posynomial Programming Approach to Transistor Sizigng. Proc. Int'l Conf. on Computer-Aided Design, 1985.
• 8: Timing Yield Estimation from Static Timing Analysis, Proceedings of the 2nd International Symposium on Quality Electronic Design, p.437, March 26-28, 2001
• 9: J. A. G. Jess, K. Kalafala, S. R. Naidu, R. H. J. M Otten, and C. Vishweswariah. Statistical timing for parametric yield prediction of digital integrated circuits. Proc. IEEE Design Automation Conf., 2002.
• 10: H-F. Jyu, S. Malik, S. Devdas, and K. Keutzer. Statistical timing analysis of combinational logic circuits. IEEE Trans. on VLSI, 1(2):126--137, June 1993.
• 11: Rung-Bin Lin , Meng-Chiou Wu, A New Statistical Approach to Timing Analysis of VLSI Circuits, Proceedings of the Eleventh International Conference on VLSI Design: VLSI for Signal Processing, p.507, January 04-07, 1998
• 12: P. B. Mirchandani and H. Soroush. Optimal paths in probabilistic networks: A case with temporary preferences. Operations Research, 1985.
• 13: A. Nadas. Probabilistic PERT. IBM Journal Res. Develop, pages 339--347, May 1979.
• 14: Kenichi Okada , Kento Yamaoka , Hidetoshi Onodera, A statistical gate delay model for intra-chip and inter-chip variabilities, Proceedings of the 2003 conference on Asia South Pacific design automation, January 21-24, 2003, Kitakyushu, Japan [doi>10.1145/1119772.1119779]
• 15: M. Pelgrom and A. Duinmaijer and A. Welbers. Matching Properties of MOS Transistors. IEEE Trans. on Solid-State Circuits, Oct 1989.
• 16: R. L. Keeny and H. Raiffa. Decisions with Multiple Objectives: Preferences and Value Tradeoffs. John Wiley & Sons, 1976.
• 17: S. S. Sapatnekar, V. B. Rao, P. M. Vaidya, S. M. Kang. An Exact Solution to Transistor Sizing Problem for CMOS Circuits using Convex Optimization. IEEE Transactions on CAD, 1993.
• 18: M. Shaked and J.G. Shanthikumar. Stochastic Orders and their Applications. Academic Press, 1994.
• 19: Chandu Visweswariah, Death, taxes and failing chips, Proceedings of the 40th conference on Design automation, June 02-06, 2003, Anaheim, CA, USA [doi>10.1145/775832.775921]

INDEX TERMS

Primary Classification:
  B. Hardware
  B.8 Performance and Reliability
      B.8.2 Performance Analysis and Design Aids

General Terms:
Algorithms, Design, Performance

Keywords:
gate sizing, timing analysis, timing yield