Nutcracker: an efficient and intelligent channel spacer
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
VIA minimization by layout modification
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
How to obtain more compactable channel routing solutions
DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
Improved channel routing by via minimization and shifting
DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
DAC '82 Proceedings of the 19th Design Automation Conference
The star-routing algorithm based on Manhattan-Diagonal model for three layers channel routing
WSEAS Transactions on Circuits and Systems
| Hi-index | 0.00 |
We study the problem of shifting vias to obtain more compactable two-layer channel routing solutions. Let S be a grid-based two-layer channel routing solution. Let vc be the number of grid points on column c that are occupied by vias. Let wc be the number of grid points on column c that are occupied by horizontal wires. We define the height of a column c to be the quantity hc= Avc + Bwc + C, where A, B, C are some design rule dependent constants. A column is said to be critical if it is a column with maximum height. Let Hs be the height of the critical column(s) in S. In general, Hs is a good measure of the channel height after compaction. We show that the problem of shifting vias to minimize Hs can be solved optimally in polynomial time. The complexity of our optimal via-shifting algorithm is O(WL(V+L)log2(V+L)) where W, L, and V are the number of tracks in S, the number of columns in S, and the number of vias in S, respectively.