在印刷電路板設計中，印刷電路板的規模變得愈大且愈複雜。交錯腳位陣列，一種新的結構被提出用以解決高腳位密度的問題。雖然逃脫繞線(escape routing)在高速印刷電路板佈線已經成為一個極為重要的問題，然而先前大部分的研究都集中在單一種類訊號的逃脫繞線，例如：差動對訊號或單訊號。先前的研究[12]提出了一種在交錯腳位陣列上的兩段式混合訊號逃脫繞線演算法;然而，由於他們建模(modeling)及繞線方法上的缺陷，所以未能完全成功處理二種訊號的逃脫繞線（差動對訊號和單訊號）。在這篇論文中，我們提出了一個在交錯腳位陣列上符合差動對訊號的線長匹配條件並且能同步處理混合訊號的逃脫繞線演算法。此演算法採用整數線性規劃，以能同時完成所有單訊號和差動對訊號的逃脫繞線。與二段式演算法比較，提出的演算法可以得到更好的逃脫繞線結果。實驗結果顯示，這種方法對於混合訊號問題的處理是相當有效的，可以降低導線長度以及達到100％線長匹配和可繞度

In PCB designs, the scale of PCB becomes larger and more complex. A new structure, the staggered pin array, is provided to address the high pin density problem. Although escape routing has become a critical issue in high-speed PCB routing, most of previous works focus on only differential-pair escape routing or single-signal escape routing. Previous work [12] has proposed a two-stage approach to the routing of mixed-pattern signals on staggered pin arrays; however, they failed to route two kinds of nets (differential pair and single signal) totally due to the defects of the modeling and the routing method. In this thesis, a simultaneous escape routing algorithm for the differential-pair nets with length matching and single-signal nets on staggered pin arrays is proposed. This algorithm adopts integer linear programming to simultaneously route all single-signal and differential-pair nets. Compared with a two-stage method, we can find better solutions for escape routing. Experimental results show the efficacy of this approach, which can significantly handle the mixed-pattern signals problem and reduce wire length under 100% length-matching and routability.

[1] J.-W. Fang and Y.-W. Chang, “Area-I/O flip-chip routing for chip-package co-design,” In Proc. Int. Conf. on Computer-Aided Design, pp. 518–522, 2008.
[2] J.-W. Fang, K.-H. Ho, and Y.-W. Chang, “Routing for chip-package-board co-design considering differential pairs,” In Proc. Int. Conf. on Computer-Aided Design, pp. 512–517, 2008.
[3] J.-W. Fang, C.-H. Hsu, and Y.-W. Chang, “An integer linear programming based routing algorithm for flip-chip design,” In Proc. Design Automation Conf., pp. 606–611, 2007.
[4] J.-W. Fang, I.-J. Lin, Y.-W. Chang, and J.-H. Wang, “A network-flow-based RDL routing algorithm for flip-chip design,” IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 26, no. 8, pp. 1417–1429, Aug. 2007.
[5] Gendreau Microsystems, Inc, http://www.gendreaumicrosystems.com/compact-pci-differential-routing.htm
[6] R. Hartley, “The Truth about Differential Pairs in High Speed PCBs,” http://www.pcbcarolina.com/images/Presentation_-_Hartley_-_Diff_Pairs.pdf
[7] Y. K. Ho, H.C. Lee, and Y. W. Chang, “Escape Routing for Staggered-Pin-Array PCBs,” In Proc. Design Automation Conf., pp. 306–309, 2011.
[8] H. W. Johnson and M. graham, “High speed signal propagation: advanced black magic,” Prentice Hall, NJ, 2003.
[9] T.-H. Li, W.-C. Chen, X.-T. Cai, and T.-C. Chen, “Escape Routing of Differential Pairs Considering Length Matching,” In Proc. Asia and South Pacific Design Automation Conf., pp. 139–144, 2012.
[10] B. Olney, “differential pair routing,” http://www.icd.com.au/articles/Differential_Pair_Routing_PCB-Oct2011.pdf
[11] R. Shi and C.-K. Cheng, “Efficient escape routing for hexagonal array of high density I/Os,” In Proc. Design Automation Conf., pp. 1003–1008, 2006.
[12] K. Wang, H.X. Wang, and S.Q. Dong, “Escape Routing of Mixed-Pattern Signals Based on Staggered-Pin-Array PCBs,” In Proc. Int. Symp. on Physical Design., pp. 93-100, 2013.
[13] R. Wang, R. Shi, and C.K. Cheng, “Layer minimization of escape routing in area array packaging,” In Proc. Int. Conf. on Computer-Aided Design, pp. 815–819, 2006.
[14]P. C. Wu and M.D.F. Wong, “Network Flow Modeling for Escape Routing on Staggered Pin Arrays,” In Proc. Asia and South Pacific Design Automation Conf., pp. 193–198, 2013.
[15] T. Yan and M.D.F. Wong, “Recent research development in PCB layout,” In Proc. Int. Conf. on Computer-Aided Design, pp. 398-403, 2010.
[16] T. Yan, P. C. Wu, Q. Ma, and M.D.F. Wong, “On the escape routing of differential pairs,” In Proc. Int. Conf. on Computer-Aided Design, pp. 614–620, 2010.
[17] M.-F. Yu and W. W.-M. Dai, “Single-layer fanout routing and routability analysis for ball grid arrays,” In Proc. Int. Conf. on Computer-Aided Design, pp. 581–586, 1995.
[18] M.-F. Yu, J. Darnauer, and W. W.-M. Dai, “Interchangeable pin routing with application to package layout,” In Proc. Int. Conf. on Computer-Aided Design, pp. 668–673, 1996.
[19] IBM ILOG CPLEX Optimizer, http://www01.ibm.com /software/integration/optimization/cplex-optimizer