ACM Home Page
Please provide us with feedback. Feedback
Considering possible opens in non-tree topology wire delay calculation
Full text PdfPdf (147 KB)
Source
Great Lakes Symposium on VLSI archive
Proceedings of the 18th ACM Great Lakes symposium on VLSI table of contents
Orlando, Florida, USA
SESSION: Session 1A: Modeling and Design under Variations table of contents
Pages 17-22  
Year of Publication: 2008
ISBN:978-1-59593-999-9
Authors
Philipp Panitz  Leibniz University of Hannover, Hannover, Germany
Markus Olbrich  Leibniz University of Hannover, Hannover, Germany
Erich Barke  Leibniz University of Hannover, Hannover, Germany
Markus Buehler  IBM Deutschland Entwicklung GmbH, Boeblingen, Germany
Juergen Koehl  IBM Deutschland Entwicklung GmbH, Boeblingen, Germany
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 30,   Citation Count: 0
Additional Information:

abstract   references   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/1366110.1366118
What is a DOI?

ABSTRACT

Non-tree routing experiences an increasing interest as technology scales into the nanometer range. Via and wire opens have become the main yield detractors considering random spot defects due to the additive manufacturing process of copper wires. Wiring networks containing loops offer some robustness against open defects which increases functional yield. State-of-the-art delay calculation enables the treatment of loops but does not provide an adequate solution for timing analysis in the presence of an open. If the delay in the presence of an open is not properly analyzed, a functional fail will be masked and replaced by a parametric fail which is only detectable applying delay testing. In this paper we present a new method to rapidly calculate the maximum delay if an open occurs in the net. For topologies consisting of non-adjacent loops we provide proof that the worst delay considering the Elmore delay metric can be found in 2N+1 delay calculations, whereas N is the number of loops in the net.


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
A. K. Stamper, et.al. Sub-0.25-micron interconnection scaling: Damascene copper versus subtractive aluminum. In Proc. of the IEEE/SEMI ASMC, pages 337---346, May 1998.
3
 
4
 
5
6
 
7
C. J. Alpert, et.al . Closed-form delay and slew metrics made easy. IEEE Trans. on CAD of Integrated Circuits and Systems, 23(12):1661---1669, December 2004.
 
8
Z. Li, Y. Zhou, and W. Shi. Wire sizing for non--tree topology. IEEE Trans. on CAD of Integrated Circuits and Systems, 26(5):872---880, May 2007.
 
9
M. Celik, L. Pileggi, and A. Odabasioglu. IC Interconnect Analysis. Kluwer Academic Publishers, 2002.
 
10
A. B. Kahng and G. Robins. On Optimal Interconnects for VLSI. Kluwer Academic Publishers, 1995.
 
11
B. A. McCoy and G. Robins. Non-tree routing. IEEE Trans. on CAD of Integrated Circuits and Systems, 14(6), June 1995.
 
12
W. C. Elmore. The transient analysis of damped linear networks with particular regard to wideband amplifiers. Journal on Applied Physics, 19(1), 1948.
 
13
P. K. Chan and K. Karplus. Computing signal delay in general rc networks by tree/link partitioning. IEEE Trans. on CAD of Integrated Circuits and Systems, 9(8):898--902, August 1990.
 
14
L. T. Pillage and R. A. Rohrer. Asymptotic waveform evaluation for timing analysis. IEEE Trans. on CAD of Integrated Circuits and Systems, 9(4):352---366, April 1990.

Collaborative Colleagues:
Philipp Panitz: colleagues
Markus Olbrich: colleagues
Erich Barke: colleagues
Markus Buehler: colleagues
Juergen Koehl: colleagues