ACM Home Page
Please provide us with feedback. Feedback
Novel sizing algorithm for yield improvement under process variation in nanometer technology
Full text PdfPdf (700 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: Yield estimation and optimization table of contents
Pages: 454 - 459  
Year of Publication: 2004
ISBN:1-58113-828-8
Authors
Seung Hoon Choi  Intel Corporation, Hillsboro, OR
Bipul C. Paul  Purdue University, W. Lafayette, IN
Kaushik Roy  Purdue University, W. Lafayette, IN
Sponsors
ACM: Association for Computing Machinery
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 41,   Citation Count: 32
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.996695
What is a DOI?

ABSTRACT

Due to process parameter variations, a large variability in circuit delay occurs in scaled technologies affecting the yield. In this paper, we propose a sizing algorithm to ensure the speed of a circuit under process variation with a certain degree of confidence while maintaining the area and power budget within a limit. This algorithm estimates the variation in circuit delay using statistical timing analysis considering both inter- and intra-die process variation and resizes the circuit to achieve a desired yield. Experimental results on several benchmark circuits show that one can achieve up to 19% savings in area (power) using our algorithm compared to the worst-case design.


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
 
3
J. P. fishburn and A. E. Dunlop, "TILOS: A posynomial programming approach to transistor sizing," IEEE Trans. CAD, pp. 326--328, 1985.
 
4
S. Sapatnekar, V. B. Rao, P. M. Vaidya, and S. M. Kang, "An exact solution of the transistor sizing problem for CMOS circuits using convex optimization," IEEE Trans. CAD, pp. 1612--1634, 1993.
 
5
A. Papoulis, Probability, Random Variables, and Stochastic Processes, McGraw-Hill, 3rd edition, 1991.
 
6
 
7
H. F. Jyu, S. Malik, S. Devadas, and K. W. Keutzer, "Statistical timing analysis of combinational logic circuits," IEEE Trans. VLSI Systems, pp. 126--137, 1993.
 
8
A. Agarwal, D. Blaauw, V. Zolotov, S. Sundareswaran, M. Zhao, K. Gala, and R. Panda, "Path-based statistical timing analysis considering inter- and intra-die correlations," TAU, 2002.
9
10
 
11
M. S. Bazaraa, H. D. Sherali, and C. M. Shetty, Nonlinear Programming: Theory and Algorithms, Wiley, 2nd edition, 1993.
 
12
BPTM, http://www-device.eecs.berkeley.edu/ptm
 
13
M. R. C. M. Berkelaar, "Statistical delay calculation, a linear time method," TAU, 1997.
 
14
C. P. Chen, C.C.N.Chu, and D.F.Wong, "Fast and exact simultaneous gate and wire sizing by Lagrangian relaxation," IEEE Trans. CAD, pp.1014--1025, 1999.
 
15
T. Sakurai and R. Newton, "Delay analysis of series-connected MOSFET circuits," IEEE JSSC, pp. 122--131, 1991.
 
16

CITED BY  32

Collaborative Colleagues:
Seung Hoon Choi: colleagues
Bipul C. Paul: colleagues
Kaushik Roy: colleagues