Two-dimensional router for double layer layout
DAC '85 Proceedings of the 22nd ACM/IEEE Design Automation Conference
WEAVER: a knowledge-based routing expert
DAC '85 Proceedings of the 22nd ACM/IEEE Design Automation Conference
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A switchbox router with obstacle avoidance
DAC '84 Proceedings of the 21st Design Automation Conference
DAC '76 Proceedings of the 13th Design Automation Conference
A solution to line-routing problems on the continuous plane
DAC '69 Proceedings of the 6th annual Design Automation Conference
A new two-dimensional routing algorithm
DAC '82 Proceedings of the 19th Design Automation Conference
ALGORITHMS FOR INTEGRATED CIRCUIT LAYOUT: AN ANALYTIC APPROACH
ALGORITHMS FOR INTEGRATED CIRCUIT LAYOUT: AN ANALYTIC APPROACH
Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)
| Hi-index | 0.00 |
A tool for switch-box routing that can route regions with cyclic constraints and with terminals on three or four sides is presented. A divide-and-conquer algorithm is used to explore the greedy channel routing idea, using techniques such as routing area partitioning, dynamic routing strategies, and sweeping concurrent bidirectional columns. The routing area is decomposed into three parts by two special lines cut parallel, making routing easier. The algorithm completely routes Burstein's switch-box problem and with an extension also routes the Deutsch channel example in 19 tracks.