Journal ArticleDOI
An improved optimal algorithm for bubble-sorting-based non-Manhattan channel routing
Reads0
Chats0
TLDR
Based on optimality-oriented swap-direction selection in an optimal bubble-sorting solution, an improved optimal algorithm for a BSNMCR problem is proposed, and the time complexity of the proposed algorithm is proven to be in O(kn) time and in O (n/sup 2/) time in the worst case.Abstract:
It is well known that a non-Manhattan channel router always uses fewer routing tracks than a Manhattan router in a channel. To our knowledge, for a bubble-sorting-based non-Manhattan channel routing (BSNMCR) problem, Chaudhary's O(kn/sup 2/) heuristic algorithm (1991) and Chen's O(k/sup 2/n) optimal algorithm (1994) have been, respectively, proposed, where it is the number of terminals and k is the number of routing tracks in a channel. However, the time complexity of the two algorithms is in O(n/sup 3/) time in the worst case. In this paper, based on optimality-oriented swap-direction selection in an optimal bubble-sorting solution, an improved optimal algorithm for a BSNMCR problem is proposed, and the time complexity of the proposed algorithm is proven to be in O(kn) time and in O(n/sup 2/) time in the worst case.read more
Citations
More filters
Journal ArticleDOI
An Efficient O( $N$ ) Comparison-Free Sorting Algorithm
TL;DR: A novel sorting algorithm that sorts input data integer elements on-the-fly without any comparison operations between the data—comparison-free sorting is proposed.
Journal ArticleDOI
Crossing-Aware Channel Routing for Integrated Optics
TL;DR: Two distinct channel routing techniques are presented: a new channel routers based on net sorting and utilizing non-Manhattan routing grids and a router based on crossing-aware graph-constrained track assignment that also exploits waveguide curves to improve track utilization.
Book ChapterDOI
Steiner Minimum Trees in Uniform Orientation Metrics
TL;DR: The Steiner tree problem as mentioned in this paper is an NP-hard problem, and it is known as the Steiner Minimum Spanning Tree (SMT) problem, which is NP-complete.
Journal ArticleDOI
Implementation of a High-Throughput Modified Merge Sort in MIMO Detection Systems
Robert Chen-Hao Chang,Ming-Fan Wei,Hung-Lieh Chen,Kuang-Hao Lin,Hou-Ming Chen,Yu-Ya Gao,Shih-Chun Lin +6 more
TL;DR: The method of modified merge sort is proposed, and the results are compared with those of five sorting algorithms, finding that this modified mergesort requires approximately 56% fewer comparators than a bitonic merge sort and approximately 46% fewerComparators than an odd-even merge sort.
Proceedings ArticleDOI
Ordered escape routing via routability-driven pin assignment
TL;DR: Based on the optimality of hierarchical bubble sorting, the process of assigning routability-driven pins is done for single-layer routing and an efficient routing approach with the consideration of variable capacity is proposed to solve the ordered escape routing problem.
References
More filters
Proceedings ArticleDOI
Wire routing by optimizing channel assignment within large apertures
TL;DR: The purpose of this paper is to introduce a new wire routing method for two layer printed circuit boards based on the newly developed channel assignment algorithm and requires many via holes.
Journal ArticleDOI
Efficient Algorithms for Channel Routing
Takeshi Yoshimura,Ernest S. Kuh +1 more
TL;DR: Two new algorithms merge nets instead of assigning horizontal tracks to individual nets to route a specified net list between two rows of terminals across a two-layer channel in the layout design of LSI chips.
Proceedings ArticleDOI
A “DOGLEG” channel router
TL;DR: The routing algorithm presented here was developed as part of LTX, a computer-aided design system for integrated circuit layout and was implemented on an HP-2100 minicomputer.
Proceedings ArticleDOI
A "Greedy" Channel Router
TL;DR: A new, “greedy”, channel-router that always succeeds, usually using no more than one track more than required by channel density, and may be forced in rare cases to make a few connections "off the end” of the channel.
Proceedings ArticleDOI
Hierarchical Channel Router
Michael Burstein,Richard Pelavin +1 more
TL;DR: A new channel routing algorithm is presented, based on reduction of the problem to the case of a (2 x n) grid and on consistent utilization of a "divide and conquer" approach, which consistently outperforms several known routers in quality of wiring.