ACM Home Page
Please provide us with feedback. Feedback
First-order incremental block-based statistical timing analysis
Full text PdfPdf (216 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 41st annual Design Automation Conference table of contents
San Diego, CA, USA
SESSION: Statistical timing analysis table of contents
Pages: 331 - 336  
Year of Publication: 2004
ISBN:1-58113-828-8
Authors
C. Visweswariah  T. J. Watson Research Center, Yorktown Heights, NY
K. Ravindran  University of California, Berkeley, CA
K. Kalafala  IBM Microelectronics, East Fishkill, NY & Burlington, VT
S. G. Walker  T. J. Watson Research Center, Yorktown Heights, NY
S. Narayan  IBM Microelectronics, East Fishkill, NY & Burlington, VT
Sponsors
ACM: Association for Computing Machinery
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 27,   Downloads (12 Months): 107,   Citation Count: 139
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/996566.996663
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
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.
3
 
4
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.
5
6
 
7
 
8
 
9
J. Jess, "Dfm in synthesis," research report, IBM Research Division, T. J. Watson Research Center, Yorktown Heights, NY 10598, December 2001.
10
 
11
C. E. Clark, "The greatest of a finite set of random variables," Operations Research, pp. 145--162, March-April 1961.
 
12
M. Cain, "The moment-generating function of the minimum of bivariate normal random variables," The American Statistician, vol. 48, pp. 124--125, May 1994.
 
13
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.
 
14
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.
 
15
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.
 
16
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.

CITED BY  139

Collaborative Colleagues:
C. Visweswariah: colleagues
K. Ravindran: colleagues
K. Kalafala: colleagues
S. G. Walker: colleagues
S. Narayan: colleagues