Geometrical compaction in one dimension for channel routing
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
Via minimization for gridless layouts
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
Fast algorithm for optimal layer assignment
DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
A switchbox router with obstacle avoidance
DAC '84 Proceedings of the 21st Design Automation Conference
DAC '82 Proceedings of the 19th Design Automation Conference
Layout optimization by pattern modification
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
MISER: an integrated three layer gridless channel router and compactor
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Optimal via-shifting in channel compaction
EURO-DAC '90 Proceedings of the conference on European design automation
On the k-layer planar subset and via minimization problems
EURO-DAC '90 Proceedings of the conference on European design automation
| Hi-index | 0.00 |
We present in this paper a new approach to the two-layer via minimization problem. Our approach is to systematically eliminate vias by modifying the routing layout. We have implemented our algorithm and applied it to benchmark routing layouts published in the literature, and obtained significant reduction in the number of vias without increasing the routing area. The experimental results show that our algorithm is more effective in via reduction and more efficient in running time compared to conventional via minimization algorithms. In particular, for Burstein's 19 track solution to Deutsch's difficult problem, our algorithm obtains 34% reduction in the number of vias, which is more than 11% improvement over the conventional CVM (constrained via minimization) approach. The application of our algorithm to various solutions to the Deutsch's difficult problem produces the fewest numbers of vias ever reported in the literature.