Global routing with crosstalk constraints

Hai Zhou; D. F. Wong

doi:10.1145/277044.277147

Global routing with crosstalk constraints

Hai Zhou, D. F. Wong

Office of the Provost

Research output: Chapter in book/report/conference proceeding › Conference proceeding › peer-review

88 Citations (Scopus)

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	https://doi.org/10.1145/277044.277147
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	https://dl.acm.org/doi/proceedings/10.1145/277044 (Conference proceedings) https://ieeexplore.ieee.org/xpl/conhome/5854/proceeding (Conference proceedings)

Access to Document

10.1145/277044.277147

Cite this

@inproceedings{17cc3bfce34a4f44b4b90893578c208e,

title = "Global routing with crosstalk constraints",

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.",

author = "Hai Zhou and Wong, {D. F.}",

note = "Funding Information: “This work was partially supported by the Texas Advanced Research Program under Grant No. 003658288. Publisher Copyright: {\textcopyright} 1998 ACM.; 35th ACM/IEEE-CAS/EDAC Design Automation Conference, DAC 1998 ; Conference date: 15-06-1998 Through 19-06-1998",

year = "1998",

month = jun,

day = "15",

doi = "10.1145/277044.277147",

language = "English",

isbn = "9780897919647",

series = "ACM/IEEE Design Automation Conference - Proceedings",

publisher = "Association for Computing Machinery (ACM)",

pages = "374--377",

booktitle = "35th ACM/IEEE Design Automation Conference - Proceedings 1998",

address = "United States",

url = "https://dl.acm.org/doi/proceedings/10.1145/277044, https://ieeexplore.ieee.org/xpl/conhome/5854/proceeding",

}

Zhou, H & Wong, DF 1998, Global routing with crosstalk constraints. in 35th ACM/IEEE Design Automation Conference - Proceedings 1998. ACM/IEEE Design Automation Conference - Proceedings, Association for Computing Machinery (ACM), pp. 374-377, 35th ACM/IEEE-CAS/EDAC Design Automation Conference, DAC 1998, San Francisco, California, United States, 15/06/98. https://doi.org/10.1145/277044.277147

TY - GEN

T1 - Global routing with crosstalk constraints

AU - Zhou, Hai

AU - Wong, D. F.

PY - 1998/6/15

Y1 - 1998/6/15

N2 - 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.

AB - 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.

UR - https://dl.acm.org/doi/10.1145/277044.277147

UR - https://ieeexplore.ieee.org/document/724500

UR - http://www.scopus.com/inward/record.url?scp=0031639541&partnerID=8YFLogxK

U2 - 10.1145/277044.277147

DO - 10.1145/277044.277147

M3 - Conference proceeding

AN - SCOPUS:0031639541

SN - 9780897919647

SN - 0897919645

T3 - ACM/IEEE Design Automation Conference - Proceedings

SP - 374

EP - 377

BT - 35th ACM/IEEE Design Automation Conference - Proceedings 1998

PB - Association for Computing Machinery (ACM)

T2 - 35th ACM/IEEE-CAS/EDAC Design Automation Conference, DAC 1998

Y2 - 15 June 1998 through 19 June 1998

ER -

Global routing with crosstalk constraints

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this