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. We present a global routing algorithm based on a new Steiner tree formulation and the Lagrangian relaxation technique. We also give theoretical results on the complexity of the problem.
Original language | English |
---|---|
Title of host publication | 35th ACM/IEEE Design Automation Conference - Proceedings 1998 |
Publisher | Association for Computing Machinery (ACM) |
Pages | 374-377 |
Number of pages | 4 |
ISBN (Print) | 9780897919647, 0897919645 |
DOIs | |
Publication status | Published - 15 Jun 1998 |
Event | 35th ACM/IEEE-CAS/EDAC Design Automation Conference, DAC 1998 - San Francisco, United States Duration: 15 Jun 1998 → 19 Jun 1998 https://dl.acm.org/doi/proceedings/10.1145/277044 (Conference proceedings) https://ieeexplore.ieee.org/xpl/conhome/5854/proceeding (Conference proceedings) |
Publication series
Name | ACM/IEEE Design Automation Conference - Proceedings |
---|---|
ISSN (Print) | 0738-100X |
Conference
Conference | 35th ACM/IEEE-CAS/EDAC Design Automation Conference, DAC 1998 |
---|---|
Country/Territory | United States |
City | San Francisco |
Period | 15/06/98 → 19/06/98 |
Internet address |
|
Scopus Subject Areas
- Computer Science Applications
- Control and Systems Engineering
- Electrical and Electronic Engineering
- Modelling and Simulation
- Hardware and Architecture