Escaped Boundary Pins Routing for High-Speed Boards

Routing for high-speed boards is still achieved manually today. There have recently been some related works to solve this problem; however, a more practical problem has not been addressed. Usually, the packages or components are designed with or without the requirement from board designers, and the boundary pins are usually fixed or advised to follow when the board design starts. In this paper, we describe this fixed ordering boundary pin routing problem, and propose a practical approach to solve it. Not only do we provide a way to address, we also further plan the wires in a better way to preserve the precious routing resources in the limited number of layers on the board, and to effectively deal with obstacles. Our approach has different features compared with the conventional shortest-path-based routing paradigm. In addition, we consider length-matching requirements and wire shape resemblance for high-speed signal routes on board. Our results show that we can utilize routing resources very carefully, and can account for the resemblance of nets in the presence of the obstacles. Our approach is workable for board buses as well.

[1]  Wayne Wei-Ming Dai,et al.  Topological routing in SURF: generating a rubber-band sketch , 1991, 28th ACM/IEEE Design Automation Conference.

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

[3]  Martin D. F. Wong,et al.  Ordered escape routing based on Boolean satisfiability , 2008, 2008 Asia and South Pacific Design Automation Conference.

[4]  Tan Yan,et al.  A correct network flow model for escape routing , 2009, 2009 46th ACM/IEEE Design Automation Conference.

[5]  David Maier,et al.  The Complexity of Some Problems on Subsequences and Supersequences , 1978, JACM.

[6]  Jason Cong,et al.  A provably good multilayer topological planar routing algorithm in IC layout designs , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  Martin D. F. Wong,et al.  Two-layer bus routing for high-speed printed circuit boards , 2006, TODE.

[8]  Martin D. F. Wong,et al.  A negotiated congestion based router for simultaneous escape routing , 2010, 2010 11th International Symposium on Quality Electronic Design (ISQED).

[9]  Martin D. F. Wong,et al.  Simultaneous Escape-Routing Algorithms for Via Minimization of High-Speed Boards , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[10]  Martin D. F. Wong,et al.  Simultaneous escape routing and layer assignment for dense PCBs , 2004, IEEE/ACM International Conference on Computer Aided Design, 2004. ICCAD-2004..

[11]  Zhanqi Dong,et al.  A Routing Method of Ad Hoc Networks Based on A-star Algorithm , 2009, 2009 International Conference on Networks Security, Wireless Communications and Trusted Computing.

[12]  Wayne Wei-Ming Dai,et al.  Single-layer fanout routing and routability analysis for Ball Grid Arrays , 1995, ICCAD.

[13]  Martin D. F. Wong,et al.  BSG-Route: A length-matching router for general topology , 2008, 2008 IEEE/ACM International Conference on Computer-Aided Design.

[14]  Martin D. F. Wong,et al.  An escape routing framework for dense boards with high-speed design constraints , 2005, ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005..

[15]  KENNETH J. SUPOWIT,et al.  Finding a Maximum Planar Subset of a Set of Nets in a Channel , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

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

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

[18]  Hui Kong,et al.  Optimal simultaneous pin assignment and escape routing for dense PCBs , 2010, 2010 15th Asia and South Pacific Design Automation Conference (ASP-DAC).

[19]  Martin D. F. Wong,et al.  B-escape: a simultaneous escape routing algorithm based on boundary routing , 2010, ISPD '10.

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