A length matching routing method for disordered pins in PCB design

In this paper, for the disordered pins in printed circuit board (PCB) design, a heuristics algorithm is proposed to obtain a length matching routing. We initially check the longest common subsequence of pin pairs to assign layers for pins. Then, adopt single commodity flow to generate base routes. R-flip and C-flip are finally carried out to adjust the wire length. The experiments show that our algorithm generates the optimal routes with better wire balance within reasonable CPU times.

[1]  Martin D. F. Wong,et al.  Algorithmic study of single-layer bus routing for high-speed boards , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[2]  Martin D. F. Wong,et al.  Advances in PCB Routing , 2012, IPSJ Trans. Syst. LSI Des. Methodol..

[3]  Martin D. F. Wong,et al.  BSG-Route: A Length-Constrained Routing Scheme for General Planar Topology , 2009, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

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

[5]  Atsushi Takahashi,et al.  A Fast Longer Path Algorithm for Routing Grid with Obstacles Using Biconnectivity Based Length Upper Bound , 2009 .

[6]  Mikel Luján,et al.  A Study of a Transactional Parallel Routing Algorithm , 2007, 16th International Conference on Parallel Architecture and Compilation Techniques (PACT 2007).

[7]  A. Gorbenko,et al.  The Longest Common Subsequence Problem , 2012 .

[8]  Tan Yan,et al.  BSG-Route: a length-matching router for general topology , 2008, ICCAD 2008.

[9]  Yoji Kajitani,et al.  On routing fixed escaped boundary pins for high speed boards , 2011, 2011 Design, Automation & Test in Europe.

[10]  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).

[11]  Martin D. F. Wong,et al.  A Length-Matching Routing Algorithm for High-Performance Printed Circuit Boards , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

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

[13]  Muhammet Mustafa Ozdal,et al.  A provably good algorithm for high performance bus routing , 2004, ICCAD 2004.

[14]  Yoji Kajitani,et al.  Escaped Boundary Pins Routing for High-Speed Boards , 2013, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.