ILP-Based Alleviation of Dense Meander Segments With Prioritized Shifting and Progressive Fixing in PCB Routing

Length-matching is an important technique to balance delays of bus signals in high-performance printed circuit board (PCB) routing. Existing routers, however, may generate very dense meander segments. Signals propagating along these meander segments exhibit a speedup effect due to crosstalk between the segments of the same wire, thus leading to mismatch of arrival times even under the same physical wire length. In this paper, we present a post-processing method to enlarge the width and the distance of meander segments and hence distribute them more evenly on the board so that crosstalk can be reduced. In the proposed framework, we model the sharing of available routing areas after removing dense meander segments from the initial routing, as well as the generation of relaxed meander segments and their groups for wire length compensation. This model is transformed into an ILP problem and solved for a balanced distribution of wire patterns. In addition, we adjust the locations of long wire segments according to wire priorities to swap free spaces toward critical wires that need much length compensation. To reduce the problem space of the ILP model, we also introduce a progressive fixing technique so that wire patterns are grown gradually from the edge of the routing toward the center area. Experimental results show that the proposed method can expand meander segments significantly even under very tight area constraints, so that the speedup effect can be alleviated effectively in high-performance PCB designs.

[1]  Yoji Kajitani,et al.  Equidistance routing in high-speed VLSI layout design , 2004, GLSVLSI '04.

[2]  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.

[3]  Evangeline F. Y. Young,et al.  An optimal algorithm for layer assignment of bus escape routing on PCBs , 2011, 2011 48th ACM/EDAC/IEEE Design Automation Conference (DAC).

[4]  Tai-Chen Chen,et al.  Escape routing of differential pairs considering length matching , 2012, 17th Asia and South Pacific Design Automation Conference.

[5]  Yao-Wen Chang,et al.  Layer minimization in escape routing for staggered-pin-array PCBs , 2013, 2013 18th Asia and South Pacific Design Automation Conference (ASP-DAC).

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

[7]  Hui Kong,et al.  An optimal algorithm for finding disjoint rectangles and its application to PCB routing , 2010, Design Automation Conference.

[8]  Martin D. F. Wong,et al.  An ILP-based automatic bus planner for dense PCBs , 2013, 2013 18th Asia and South Pacific Design Automation Conference (ASP-DAC).

[9]  Qing He,et al.  Design of a Controllable Delay Line , 2010, IEEE Transactions on Advanced Packaging.

[10]  Atsushi Takahashi,et al.  A fast longer path algorithm for routing grid with obstacles using biconnectivity based length upper bound , 2009, 2009 Asia and South Pacific Design Automation Conference.

[11]  Qiang Gao,et al.  LEMAR: A novel length matching routing algorithm for analog and mixed signal circuits , 2012, 17th Asia and South Pacific Design Automation Conference.

[12]  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.

[13]  Ulf Schlichtmann,et al.  Post-route alleviation of dense meander segments in high-performance printed circuit boards , 2013, 2013 IEEE/ACM International Conference on Computer-Aided Design (ICCAD).

[14]  Evangeline F. Y. Young,et al.  A provably good approximation algorithm for Rectangle Escape Problem with application to PCB routing , 2011, 16th Asia and South Pacific Design Automation Conference (ASP-DAC 2011).

[15]  Ruey-Beei Wu,et al.  Laddering wave in serpentine delay line , 1995 .

[16]  Ruey-Beei Wu,et al.  Flat spiral delay line design with minimum crosstalk penalty , 1996 .

[17]  Qiang Gao,et al.  Length matching in detailed routing for analog and mixed signal circuits , 2014, Microelectron. J..

[18]  B. J. Rubin,et al.  Study of meander line delay in circuit boards , 1999, IEEE 8th Topical Meeting on Electrical Performance of Electronic Packaging (Cat. No.99TH8412).

[19]  Chung-Kuan Cheng,et al.  Layer Minimization of Escape Routing in Area Array Packaging , 2006, 2006 IEEE/ACM International Conference on Computer Aided Design.

[20]  Omar M. Ramahi "Analysis of Conventional and Novel Delay Lines: A Numerical Study" , 2003 .

[21]  Der-San Chen,et al.  Applied Integer Programming: Modeling and Solution , 2010 .

[22]  Hui Kong,et al.  Automatic bus planner for dense PCBs , 2009, 2009 46th ACM/IEEE Design Automation Conference.

[23]  Atsushi Takahashi,et al.  An any-angle routing method using quasi-Newton method , 2012, 17th Asia and South Pacific Design Automation Conference.

[24]  Yao-Wen Chang,et al.  Escape Routing for Staggered-Pin-Array PCBs , 2013, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.