Abstract
A new VLSI router, DAPRT, is proposed. It can route regions with cyclic constraints and with pins on three or four sides in two-layer technology. Based on the 'greedy' channel routing idea, the new dynamic routing area partition scheme and bidirectional column sweeping approach are introduced in DAPRT. Look-ahead routing strategies are used in it dynamically according to the routing congestion. M. Burstein's difficult switchbox problem (1983) was solved by DAPRT 100% routability. D. N. Deutsch's difficult example (1976) is also routed in optimal track number (i. e. , 19 tracks) by DAPRT.
| Original language | English |
|---|---|
| Pages (from-to) | 303-306 |
| Number of pages | 4 |
| Journal | Proceedings - IEEE International Symposium on Circuits and Systems |
| Publication status | Published - 1986 Jan 1 |
All Science Journal Classification (ASJC) codes
- Electrical and Electronic Engineering