An efficient optimum channel routing algorithm

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

1 Citation (Scopus)

Abstract

An optimal channel routing algorithm for a detailed two-layer channel routing is proposed. Through the inclusion of appropriate net characteristic information in the node searching function, this algorithm expands far fewer nodes than Wang's (1990) algorithm to obtain optimum solutions on all of the benchmark problems presented by T. Yoshimura and E. S. Kuh (1982). Since the two-layer model has a minimum number of vias and a minimum length of wires, the proposed algorithm is suitable for the routing of channels with mixed analog/digital signals.

Original languageEnglish
Title of host publicationConference Proceedings - IEEE SOUTHEASTCON
PublisherPubl by IEEE
Pages1179-1183
Number of pages5
ISBN (Print)0780300335
Publication statusPublished - 1991 Jan 1
EventIEEE Proceedings of the SOUTHEASTCON '91 - Williamsburg, VA, USA
Duration: 1991 Apr 81991 Apr 10

Publication series

NameConference Proceedings - IEEE SOUTHEASTCON
Volume2
ISSN (Print)0734-7502

Other

OtherIEEE Proceedings of the SOUTHEASTCON '91
CityWilliamsburg, VA, USA
Period91-04-0891-04-10

Fingerprint

Routing algorithms
Wire

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this

Lin, Z. M. (1991). An efficient optimum channel routing algorithm. In Conference Proceedings - IEEE SOUTHEASTCON (pp. 1179-1183). (Conference Proceedings - IEEE SOUTHEASTCON; Vol. 2). Publ by IEEE.
Lin, Zhi Ming. / An efficient optimum channel routing algorithm. Conference Proceedings - IEEE SOUTHEASTCON. Publ by IEEE, 1991. pp. 1179-1183 (Conference Proceedings - IEEE SOUTHEASTCON).
@inproceedings{30340e9f113d4291a7e009d6eebc5077,
title = "An efficient optimum channel routing algorithm",
abstract = "An optimal channel routing algorithm for a detailed two-layer channel routing is proposed. Through the inclusion of appropriate net characteristic information in the node searching function, this algorithm expands far fewer nodes than Wang's (1990) algorithm to obtain optimum solutions on all of the benchmark problems presented by T. Yoshimura and E. S. Kuh (1982). Since the two-layer model has a minimum number of vias and a minimum length of wires, the proposed algorithm is suitable for the routing of channels with mixed analog/digital signals.",
author = "Lin, {Zhi Ming}",
year = "1991",
month = "1",
day = "1",
language = "English",
isbn = "0780300335",
series = "Conference Proceedings - IEEE SOUTHEASTCON",
publisher = "Publ by IEEE",
pages = "1179--1183",
booktitle = "Conference Proceedings - IEEE SOUTHEASTCON",

}

Lin, ZM 1991, An efficient optimum channel routing algorithm. in Conference Proceedings - IEEE SOUTHEASTCON. Conference Proceedings - IEEE SOUTHEASTCON, vol. 2, Publ by IEEE, pp. 1179-1183, IEEE Proceedings of the SOUTHEASTCON '91, Williamsburg, VA, USA, 91-04-08.

An efficient optimum channel routing algorithm. / Lin, Zhi Ming.

Conference Proceedings - IEEE SOUTHEASTCON. Publ by IEEE, 1991. p. 1179-1183 (Conference Proceedings - IEEE SOUTHEASTCON; Vol. 2).

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

TY - GEN

T1 - An efficient optimum channel routing algorithm

AU - Lin, Zhi Ming

PY - 1991/1/1

Y1 - 1991/1/1

N2 - An optimal channel routing algorithm for a detailed two-layer channel routing is proposed. Through the inclusion of appropriate net characteristic information in the node searching function, this algorithm expands far fewer nodes than Wang's (1990) algorithm to obtain optimum solutions on all of the benchmark problems presented by T. Yoshimura and E. S. Kuh (1982). Since the two-layer model has a minimum number of vias and a minimum length of wires, the proposed algorithm is suitable for the routing of channels with mixed analog/digital signals.

AB - An optimal channel routing algorithm for a detailed two-layer channel routing is proposed. Through the inclusion of appropriate net characteristic information in the node searching function, this algorithm expands far fewer nodes than Wang's (1990) algorithm to obtain optimum solutions on all of the benchmark problems presented by T. Yoshimura and E. S. Kuh (1982). Since the two-layer model has a minimum number of vias and a minimum length of wires, the proposed algorithm is suitable for the routing of channels with mixed analog/digital signals.

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

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

M3 - Conference contribution

AN - SCOPUS:0025839988

SN - 0780300335

T3 - Conference Proceedings - IEEE SOUTHEASTCON

SP - 1179

EP - 1183

BT - Conference Proceedings - IEEE SOUTHEASTCON

PB - Publ by IEEE

ER -

Lin ZM. An efficient optimum channel routing algorithm. In Conference Proceedings - IEEE SOUTHEASTCON. Publ by IEEE. 1991. p. 1179-1183. (Conference Proceedings - IEEE SOUTHEASTCON).