ACM Home Page
Please provide us with feedback. Feedback
On bounding the delay of a critical path
Full text PdfPdf (270 KB)
Source International Conference on Computer Aided Design archive
Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design table of contents
San Jose, California
SESSION: Efficient delay test generation table of contents
Pages: 81 - 88  
Year of Publication: 2006
ISBN ~ ISSN:1092-3152 , 1-59593-389-1
Authors
Leonard Lee  University of California - Santa Barbara, Santa Barbara, CA
Li-C. Wang  University of California - Santa Barbara, Santa Barbara, CA
Sponsors
IEEE-CS : Computer Society
IEEE-CAS : Circuits & Systems
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 11,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

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

ABSTRACT

Process variations cause different behavior of timing-dependent effects across different chips. In this work, we analyze one example of timing-dependent effects, cross-coupling capacitance, and the complex problem space created by considering coupling and process variations together. The delay of a critical path under these conditions is difficult to bound for design and test. We develop a methodology that analyzes this complex space by decomposing the problem space along three dimensions: the aggressor space, test space, and sample space. For design, we utilize an OBDD-based approach to prune the aggressor space based on logical constraints, which can be combined with a worst-case timing window simulator to prune based on both logical and timing constraints. After pruning, the reduced aggressor space can be used to derive a more accurate timing bound. Solving the problems in the test and sample spaces is postponed to the post-silicon stage, where we propose a test selection methodology for bounding the delay of every sample. This methodology is based on probability density estimation and has a tradeoff between the number of tests to apply and the tightness of the delay bound obtained. Experimental results based on benchmark examples are presented to show the effectiveness of the proposed methodology.


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
Layout and parasitic information for ISCAS circuits. http://dropzone.tamu.edu/~xiang/iscas.html.
 
2
The R project for statistical computing. http://www.r-project.org/.
3
 
4
5
 
6
 
7
 
8
 
9
10
 
11
 
12
 
13
A. B. Kahng et al. Noise and delay uncertainty studies for coupled RC interconnects. In ASIC/SOC, 1999.
 
14
 
15
 
16
 
17
 
18
 
19
J. Qian et al. Modeling the effective capacitance for the RC interconnect of CMOS gates. IEEE Trans. Computer-Aided Design, 13(12):1526--1555, Dec. 1994.
 
20
T. Sakurai. Closed-form expressions for interconnection delay, coupling, and crosstalk in VLSI's. Trans. Elect. Dev., 40(1):118--124, Jan. 1993.
 
21
S. J. Sheather and M. C. Jones. A reliable data-based bandwidth selection method for kernel density estimation. J. Roy. Statist. Soc. B, 53:683--690, 1991.
 
22
B. W. Silverman. Density Estimation. Chapman and Hall, 1986.
 
23