Abstract
In this paper, a heuristic planar routing strategy for high performance single-layer layout is presented. The main goal of the approach is to optimize routing performance, i.e., maximize the routed Steiner-length with minimum overhead of routing lengths and number of bends. First, the Shape-Algorithm is introduced to determine the routing sequence for L-shaped nets. Then, the Flow-Algorithm, is applied based on a rubber-band equivalent (RBE) of the sketch to route the rest of the incomplete nets. The technique has been implemented and tried out for randomly generated data and examples. Simulation results show that the algorithm is highly efficient in high performance routing.
| Original language | English |
|---|---|
| Pages (from-to) | 143-158 |
| Number of pages | 16 |
| Journal | Journal of the Chinese Institute of Electrical Engineering, Transactions of the Chinese Institute of Engineers, Series E/Chung KuoTien Chi Kung Chieng Hsueh K'an |
| Volume | 8 |
| Issue number | 2 |
| Publication status | Published - 2001 May 1 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Electrical and Electronic Engineering
Cite this
}
A heuristic planar routing algorithm for high performance layouts. / Lin, Z. M.
In: Journal of the Chinese Institute of Electrical Engineering, Transactions of the Chinese Institute of Engineers, Series E/Chung KuoTien Chi Kung Chieng Hsueh K'an, Vol. 8, No. 2, 01.05.2001, p. 143-158.Research output: Contribution to journal › Article
TY - JOUR
T1 - A heuristic planar routing algorithm for high performance layouts
AU - Lin, Z. M.
PY - 2001/5/1
Y1 - 2001/5/1
N2 - In this paper, a heuristic planar routing strategy for high performance single-layer layout is presented. The main goal of the approach is to optimize routing performance, i.e., maximize the routed Steiner-length with minimum overhead of routing lengths and number of bends. First, the Shape-Algorithm is introduced to determine the routing sequence for L-shaped nets. Then, the Flow-Algorithm, is applied based on a rubber-band equivalent (RBE) of the sketch to route the rest of the incomplete nets. The technique has been implemented and tried out for randomly generated data and examples. Simulation results show that the algorithm is highly efficient in high performance routing.
AB - In this paper, a heuristic planar routing strategy for high performance single-layer layout is presented. The main goal of the approach is to optimize routing performance, i.e., maximize the routed Steiner-length with minimum overhead of routing lengths and number of bends. First, the Shape-Algorithm is introduced to determine the routing sequence for L-shaped nets. Then, the Flow-Algorithm, is applied based on a rubber-band equivalent (RBE) of the sketch to route the rest of the incomplete nets. The technique has been implemented and tried out for randomly generated data and examples. Simulation results show that the algorithm is highly efficient in high performance routing.
UR - http://www.scopus.com/inward/record.url?scp=0035334571&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0035334571&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:0035334571
VL - 8
SP - 143
EP - 158
JO - International Journal of Electrical Engineering
JF - International Journal of Electrical Engineering
SN - 1812-3031
IS - 2
ER -