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 |
All Science Journal Classification (ASJC) codes
- Electrical and Electronic Engineering
Fingerprint Dive into the research topics of 'An efficient optimum channel routing algorithm'. Together they form a unique fingerprint.
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.