Novel routing schemes for IC layout part I: Two-layer channel routing
DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
DAC '83 Proceedings of the 20th Design Automation Conference
DAC '76 Proceedings of the 13th Design Automation Conference
Wire routing by optimizing channel assignment within large apertures
DAC '71 Proceedings of the 8th Design Automation Workshop
DAC '82 Proceedings of the 19th Design Automation Conference
An improved optimal algorithm for bubble-sorting-based non-Manhattan channel routing
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Manhattan-diagonal routing in channels and switchboxes
ACM Transactions on Design Automation of Electronic Systems (TODAES)
| Hi-index | 0.00 |
It is well known that a nonManhattan channel router can use fewer routing tracks, and is never worse than a Manhattan router in a channel. To my knowledge, a three-layer bubble-sorting-based nonManhattan channel routing problem is always solved by the solution in a two-layer bubble-sorintg-based nonManhattan channel routing problem. Recently, an O(kn2) heuristic algorithm [Chaudhary et al. 1991] and an O(kn2) optimal algorithm [Chen et al. 1994] have been proposed, where k is the number of two-layer routing tracks and n is the number of terminals in a bubble-sorintg-based nonManhattan channel. In this paper we propose an optimal three-layer bubble-sorintg-based nonManhattan routing algorithm to minimize the number of three-layer routing tracks. Furthermore, the time complexity of theis optimal algorithm is proven to be in O(hn) time, where h is the number of three-layer routing tracks and n is the number of terminals in a bubble-sorting-based nonManhattan channel.