ACM Home Page
Please provide us with feedback. Feedback
Yield driven gate sizing for coupling-noise reduction under uncertainty
Full text PdfPdf (166 KB)
Source Asia and South Pacific Design Automation Conference archive
Proceedings of the 2005 Asia and South Pacific Design Automation Conference table of contents
Shanghai, China
SESSION: TCAD table of contents
Pages: 192 - 197  
Year of Publication: 2005
ISBN:0-7803-8737-6
Authors
Debjit Sinha  Northwestern University, Evanston, IL
Hai Zhou  Northwestern University, Evanston, IL
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
: Shanghai IC Industry Association
: IEEE SSCS Shanghai Chapter
: IEEE CAS
: IEEE Beijing Section
: Fudan University
: Chinese Institute of Electronics
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 10,   Citation Count: 0
Additional Information:

abstract   references   collaborative colleagues  

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

ABSTRACT

This paper presents a post-route gate-sizing algorithm for coupling-noise reduction that constrains the yield loss under process variations. Algorithms for coupling-noise reduction which do not consider uncertainty in the manufacturing process can make a circuit susceptible to failure. Using probabilistic models, the coupling-noise reduction problem is solved as a fixpoint computation problem on a lattice. A novel gate-sizing algorithm with low area overhead is proposed for coupling-noise reduction under uncertainty. Experimental results are reported for the ISCAS benchmarks and larger circuits with comparisons to traditional approaches.


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
S. I. Association, "National technology roadmap for semiconductors," 1999.
2
 
3
S. Nassif, "Modeling and analysis of manufacturing variations," in Proc. Custom Integrated Circuits Conf., 2001.
4
 
5
T. Xiao and M. Marek-Sadowska, "Crosstalk reduction by transistor sizing," in Proc. Asian and South Pacific Design Automation Conference, 1999, pp. 137--140.
6
7
8
 
9
 
10
H. Zhou, "Timing analysis with crosstalk is a fixpoint on a complete lattice," in IEEE Transactions on Computer-Aided Design, September 2003, pp. 1261--1269.
 
11
F. Brglez and H. Fujiwara, "A neutral netlist of 10 combinatorial benchmark circuits," in Proc. Intl. Symposium on Circuits and Systems, 1985, pp. 695--698.
 
12
G. Grimmett and D. Stirzaker, Probability and random processes. Oxford University Press, 2002.
 
13
 
14
B. A. Davey and H. A. Priestley, Introduction to lattices and order. Cambridge, 1990.
15
 
16
J. Cong, D. Z. Pang, and P. V. Srinivas, "Improved crosstalk modeling for noise constrained interconnect optimization," in ACM Intl. Workshop on Timing Issues in the Specification and Synthesis of Digital Systems, 2000.