Topological routing using geometric information

Shinichiro Haruyama; D.F. Wong; Don Fussell

doi:10.1109/ICCAD.1990.129825

Topological routing using geometric information

Shinichiro Haruyama, D.F. Wong, Don Fussell

Office of the Provost

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

1 Citation (Scopus)

Abstract

A novel method is proposed for the two-layer topological channel routing problem. The authors' algorithm takes geometric information into consideration when a topological solution is obtained. Experimental results show that the algorithm generates very good solutions. For example, the authors have obtained a height of 41 for Deutsch's difficult example without any parallel overlaps of wires while simultaneously achieving a via count of 219.

Original language	English
Title of host publication	1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers
Publisher	IEEE
Pages	6-9
Number of pages	4
ISBN (Print)	0818620552
DOIs	https://doi.org/10.1109/ICCAD.1990.129825
Publication status	Published - 15 Nov 1990
Event	1990 IEEE International Conference on Computer-Aided Design, ICCAD 1990 - Santa Clara, United States Duration: 11 Nov 1990 → 15 Nov 1990 https://ieeexplore.ieee.org/xpl/conhome/296/proceeding

Publication series

Name	IEEE International Conference on Computer-Aided Design

Conference

Conference	1990 IEEE International Conference on Computer-Aided Design, ICCAD 1990
Country/Territory	United States
City	Santa Clara
Period	11/11/90 → 15/11/90
Internet address	https://ieeexplore.ieee.org/xpl/conhome/296/proceeding

User-Defined Keywords

Routing
Wires

Access to Document

10.1109/ICCAD.1990.129825

Cite this

@inproceedings{432b837f573d4f10ad959c0789811c0d,

title = "Topological routing using geometric information",

abstract = "A novel method is proposed for the two-layer topological channel routing problem. The authors' algorithm takes geometric information into consideration when a topological solution is obtained. Experimental results show that the algorithm generates very good solutions. For example, the authors have obtained a height of 41 for Deutsch's difficult example without any parallel overlaps of wires while simultaneously achieving a via count of 219.",

keywords = "Routing, Wires",

author = "Shinichiro Haruyama and D.F. Wong and Don Fussell",

note = "The first author was partially supported by ASCII Corporation, Tokyo. The second author was partially supported by the National Science Foundation under grant MIP-8909586, by the Texas Advanced Research Program under grant 4096 and by an IBM Faculty Development Award.; 1990 IEEE International Conference on Computer-Aided Design, ICCAD 1990 ; Conference date: 11-11-1990 Through 15-11-1990",

year = "1990",

month = nov,

day = "15",

doi = "10.1109/ICCAD.1990.129825",

language = "English",

isbn = "0818620552",

series = "IEEE International Conference on Computer-Aided Design",

publisher = "IEEE",

pages = "6--9",

booktitle = "1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers",

address = "United States",

url = "https://ieeexplore.ieee.org/xpl/conhome/296/proceeding",

}

Haruyama, S, Wong, DF & Fussell, D 1990, Topological routing using geometric information. in 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers. IEEE International Conference on Computer-Aided Design, IEEE, pp. 6-9, 1990 IEEE International Conference on Computer-Aided Design, ICCAD 1990, Santa Clara, California, United States, 11/11/90. https://doi.org/10.1109/ICCAD.1990.129825

TY - GEN

T1 - Topological routing using geometric information

AU - Haruyama, Shinichiro

AU - Wong, D.F.

AU - Fussell, Don

N1 - The first author was partially supported by ASCII Corporation, Tokyo. The second author was partially supported by the National Science Foundation under grant MIP-8909586, by the Texas Advanced Research Program under grant 4096 and by an IBM Faculty Development Award.

PY - 1990/11/15

Y1 - 1990/11/15

N2 - A novel method is proposed for the two-layer topological channel routing problem. The authors' algorithm takes geometric information into consideration when a topological solution is obtained. Experimental results show that the algorithm generates very good solutions. For example, the authors have obtained a height of 41 for Deutsch's difficult example without any parallel overlaps of wires while simultaneously achieving a via count of 219.

AB - A novel method is proposed for the two-layer topological channel routing problem. The authors' algorithm takes geometric information into consideration when a topological solution is obtained. Experimental results show that the algorithm generates very good solutions. For example, the authors have obtained a height of 41 for Deutsch's difficult example without any parallel overlaps of wires while simultaneously achieving a via count of 219.

KW - Routing

KW - Wires

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

U2 - 10.1109/ICCAD.1990.129825

DO - 10.1109/ICCAD.1990.129825

M3 - Conference proceeding

SN - 0818620552

T3 - IEEE International Conference on Computer-Aided Design

SP - 6

EP - 9

BT - 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers

PB - IEEE

T2 - 1990 IEEE International Conference on Computer-Aided Design, ICCAD 1990

Y2 - 11 November 1990 through 15 November 1990

ER -

Topological routing using geometric information

Abstract

Publication series

Conference

User-Defined Keywords

Access to Document

Other files and links

Fingerprint

Cite this