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 language | English |
|---|---|
| Title of host publication | Conference Proceedings - IEEE SOUTHEASTCON |
| Publisher | Publ by IEEE |
| Pages | 1179-1183 |
| Number of pages | 5 |
| ISBN (Print) | 0780300335 |
| Publication status | Published - 1991 Jan 1 |
| Event | IEEE Proceedings of the SOUTHEASTCON '91 - Williamsburg, VA, USA Duration: 1991 Apr 8 → 1991 Apr 10 |
Publication series
| Name | Conference Proceedings - IEEE SOUTHEASTCON |
|---|---|
| Volume | 2 |
| ISSN (Print) | 0734-7502 |
Other
| Other | IEEE Proceedings of the SOUTHEASTCON '91 |
|---|---|
| City | Williamsburg, VA, USA |
| Period | 91-04-08 → 91-04-10 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Electrical and Electronic Engineering
Cite this
}
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 proceeding › Conference 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 -