ACM Home Page
Please provide us with feedback. Feedback
Correlation-preserved non-gaussian statistical timing analysis with quadratic timing model
Full text PdfPdf (1.41 MB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 42nd annual Design Automation Conference table of contents
Anaheim, California, USA
SESSION: Statistical timing analysis table of contents
Pages: 83 - 88  
Year of Publication: 2005
ISBN:1-59593-058-2
Authors
Lizheng Zhang  University of Wisconsin, Madison, WI
Weijen Chen  University of Wisconsin, Madison, WI
Yuhen Hu  University of Wisconsin, Madison, WI
John A. Gubner  University of Wisconsin, Madison, WI
Charlie Chung-Ping Chen  University of Wisconsin, Madison, WI
Sponsors
ACM: Association for Computing Machinery
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 38,   Citation Count: 31
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/1065579.1065606
What is a DOI?

ABSTRACT

Recent study shows that the existing first order canonical timing model is not sufficient to represent the dependency of the gate delay on the variation sources when processing and operational variations become more and more significant. Due to the nonlinearity of the mapping from variation sources to the gate/wire delay, the distribution of the delay is no longer Gaussian even if the variation sources are normally distributed. A novel quadratic timing model is proposed to capture the non-linearity of the dependency of gate/wire delays and arrival times on the variation sources. Systematic methodology is also developed to evaluate the correlation and distribution of the quadratic timing model. Based on these, a novel statistical timing analysis algorithm is propose which retains the complete correlation information during timing analysis and has the same computation complexity as the algorithm based on the canonical timing model. Tested on the ISCAS circuits, the proposed algorithm shows 10x accuracy improvement over the existing first order algorithm while no significant extra runtime is needed.


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
M. Orshansky, "Fast computation of circuit delay probability distribution for timing graphs with arbitary node correlation," TAU'04, Feb 2004.
3
4
 
5
A. Agarwal, V. Zolotov, and D. Blaauw, "Statistical timing analysis using bounds and selective enumeration," IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 22, no. 9, pp. 1243--1260, Sept 2003.
6
 
7
 
8
 
9
 
10
11
 
12
S. R. Nassif, "Modeling and analysis of manufacturing variations," CICC, pp. 223--228, 2001.
 
13
S. Nassif, "Within-chip variability analysis," Electron Devices Meeting, 1998. IEDM '98 Technical Digest., International, pp. 283--286, Dec 1998.
 
14
 
15
B. V. Gnedenko, Theory of Probability, 6th ed. Gordon and Breach Science Publishers, 1997, translated from Russian by Igor A. Ushakov.
 
16
C. Clark, "The greatest of a finite set of random variables," Operations Research, pp. 145--162, March 1961.

CITED BY  34

Collaborative Colleagues:
Lizheng Zhang: colleagues
Weijen Chen: colleagues
Yuhen Hu: colleagues
John A. Gubner: colleagues
Charlie Chung-Ping Chen: colleagues