Linear optimal one-sided single-detour algorithm for untangling twisted bus

We considered the one-sided single-detour untangling twisted nets problem for printed circuit board bus routing. A previous optimal dynamic programming based O(n3) algorithm was proposed in a previous work, where n is the number of nets. In this paper, we propose an optimal O(n) untangling algorithm without considering capacity, and this algorithm is further modified to consider capacity. Experimental results show that our algorithms runs much faster than the previous work due to its low time complexity.

[1]  Zhi-Wei Chen,et al.  Obstacle-aware length-matching bus routing , 2011, ISPD '11.

[2]  Zhi-Wei Chen,et al.  Two-sided single-detour untangling for bus routing , 2010, Design Automation Conference.

[3]  Martin D. F. Wong,et al.  Theories and algorithms on single-detour routing for untangling twisted bus , 2009, TODE.

[4]  Muhammet Mustafa Ozdal,et al.  Length-Matching Routing for High-Speed Printed Circuit Boards , 2003, ICCAD 2003.

[5]  Atsushi Takahashi,et al.  CAFE router: A fast connectivity aware multiple nets routing algorithm for routing grid with obstacles , 2010, 2010 15th Asia and South Pacific Design Automation Conference (ASP-DAC).

[6]  Martin D. F. Wong,et al.  A provably good algorithm for high performance bus routing , 2004, IEEE/ACM International Conference on Computer Aided Design, 2004. ICCAD-2004..