Untangling twisted nets for bus routing
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
BSG-Route: a length-matching router for general topology
Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design
An improved optimal algorithm for bubble-sorting-based non-Manhattan channel routing
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Algorithmic study of single-layer bus routing for high-speed boards
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
A Length-Matching Routing Algorithm for High-Performance Printed Circuit Boards
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Obstacle-aware length-matching bus routing
Proceedings of the 2011 international symposium on Physical design
Recent research development in PCB layout
Proceedings of the International Conference on Computer-Aided Design
| Hi-index | 0.00 |
In this paper, based on the optimality of hierarchical bubble sorting, the problem of two-sided single-detour untangling for single-layer bus routing is firstly formulated. Compared with an optimal O(n3) algorithm[4] for one-sided single-detour untangling without capacity consideration, an optimal O(n2) algorithm is proposed to solve the two-sided single-detour untangling problem without capacity consideration. For two-sided single-detour untangling with capacity consideration, an efficient O(n2) algorithm is proposed and the experimental results show that our proposed algorithm can successfully untangle all the twisted nets for the tested examples in less CPU time.