Chen, S.-S.S.-S.ChenYang, C.-H.C.-H.YangSAO-JIE CHEN2009-03-112018-07-062009-03-112018-07-06200013502387http://ntur.lib.ntu.edu.tw//handle/246246/144068https://www.scopus.com/inward/record.uri?eid=2-s2.0-0034313230&doi=10.1049%2fip-cdt%3a20000810&partnerID=40&md5=05dc67ffedf3bf181b16813a4dc43f9aAn 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.application/pdf207568 bytesapplication/pdfen-USAlgorithms; Communication channels (information theory); Computational complexity; Problem solving; Sorting; Bubble-sort technique; Channel routing; Routersjournal article10.1049/ip-cdt:200008102-s2.0-0034313230http://ntur.lib.ntu.edu.tw/bitstream/246246/144068/1/10.pdf