Topological routing using geometric information

Shinichiro Haruyama, D. F. Wong, Don Fussell

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish
Title of host publication1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers
PublisherPubl by IEEE
Pages6-9
Number of pages4
ISBN (Print)0818620552
Publication statusPublished - 1990
Externally publishedYes
Event1990 IEEE International Conference on Computer-Aided Design - ICCAD-90 - Santa Clara, CA, USA
Duration: 1990 Nov 111990 Nov 15

Other

Other1990 IEEE International Conference on Computer-Aided Design - ICCAD-90
CitySanta Clara, CA, USA
Period90/11/1190/11/15

Fingerprint

Wire

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Haruyama, S., Wong, D. F., & Fussell, D. (1990). Topological routing using geometric information. In 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers (pp. 6-9). Publ by IEEE.

Topological routing using geometric information. / Haruyama, Shinichiro; Wong, D. F.; Fussell, Don.

1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers. Publ by IEEE, 1990. p. 6-9.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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. Publ by IEEE, pp. 6-9, 1990 IEEE International Conference on Computer-Aided Design - ICCAD-90, Santa Clara, CA, USA, 90/11/11.
Haruyama S, Wong DF, Fussell D. Topological routing using geometric information. In 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers. Publ by IEEE. 1990. p. 6-9
Haruyama, Shinichiro ; Wong, D. F. ; Fussell, Don. / Topological routing using geometric information. 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers. Publ by IEEE, 1990. pp. 6-9
@inproceedings{acc0023edcc649cfa4d1c9ad83053e38,
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.",
author = "Shinichiro Haruyama and Wong, {D. F.} and Don Fussell",
year = "1990",
language = "English",
isbn = "0818620552",
pages = "6--9",
booktitle = "1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - Topological routing using geometric information

AU - Haruyama, Shinichiro

AU - Wong, D. F.

AU - Fussell, Don

PY - 1990

Y1 - 1990

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.

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

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

M3 - Conference contribution

AN - SCOPUS:0025568058

SN - 0818620552

SP - 6

EP - 9

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

PB - Publ by IEEE

ER -