Abstract
An efficient bubble-sort technique for solving the two-layer non-Manhattan channel-routing problem is presented. The time and space complexities of our algorithm are O(kn) and O(n), respectively, where k is the number of sorting passes required and n is the total number of two-terminal nets in a routing channel. The algorithm is easily extended to handle the cases with multiterminal nets distributed in a channel. Various tests verify the efficiency of the bubble-sort based router. Experimental results indicate that the router is time-efficient for routing. A three-layer algorithm having O(kn) time based on an identical problem formulation is proposed for solving the non-Manhattan channel routing.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEE Proceedings - Computers and Digital Techniques
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
