ACM Home Page
Please provide us with feedback. Feedback
Global routing with crosstalk constraints
Full text PdfPdf (218 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 35th annual Design Automation Conference table of contents
San Francisco, California, United States
Pages: 374 - 377  
Year of Publication: 1998
ISBN:0-89791-964-5
Authors
Hai Zhou  Department of Computer Sciences, University of Texas, Austin, TX
D. F. Wong  Department of Computer Sciences, University of Texas, Austin, TX
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
EDAC : Electronic Design Automation Consortium
IEEE-CS : Computer Society
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 26,   Citation Count: 35
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/277044.277147
What is a DOI?

ABSTRACT

Due to the scaling down of device geometry and increasing frequency in deep sub-micron designs, crosstalk between interconnection wires has become an important issue in VLSI layout design. In this paper, we consider crosstalk avoidance during global routing. W e present a global routing algorithm based on a new Steiner tree formulation and the Lagrangian relaxation technique. W e also give theoretical results on the complexity of the problem.


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
H.B. Bakoglu, Circuits, interconnections and packaging for VLSI. Addison- Wesley, 1990.
 
3
 
4
 
5
 
6
 
7
 
8
F.K. Hwang, D.S. Richards, and P. Winter, The Steiner Tree Problem. North-Holland, 1992.
 
9
 
10
T. Sakurai and K. Tamaru, Simple formulas for two and three dimensional capacitance. IEEE Trans. Electron Devices, 1993.
 
11
S. Thakur, K.-Y. Chao and D.F. Wong, An Optimal Layer Assignment Algorithm for Minimizing Crosstalk for Three Layer VHV Channel Routing. ISCAS, 1995.
 
12
 
13
 
14
 
15
H. Zhou and D.F. Wong, Crosstalk Constrained Maze Routing Based on Lagrangian Relaxation. ICCD, 1997.

CITED BY  35