IO connection assignment and RDL routing for flip-chip designs

Given a set of IO buffers and bump balls with the capacity constraints between bump balls, an O(n2) IO assignment and RDL routing algorithm is proposed to assign all the IO connections and minimize the total wirelength with satisfying the capacity constraints and guarantee 100% routability if the capacity constraint is permitted, where n is the number of bump balls in a flip-chip design. Compared with the combination of the greedy IO assignment and our RDL routing, our IO assignment reduces the global wirelength by 7.6% after global routing and improves the routability by 8.8% after detailed routing on the average. Compared with the combination of our IO assignment, the single-layer BGA global router[8] and our detailed routing phase, our RDL routing reduces the global wirelength by 15.9% after global routing and improve the routability by 10.6% after detailed routing on the average for some tested circuits in reasonable CPU time.

[1]  Jin-Tai Yan,et al.  Dynamic tree reconstruction with application to timing-constrained congestion-driven global routing , 2006, 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (VLSID'06).

[2]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[3]  Yao-Wen Chang,et al.  A routing algorithm for flip-chip design , 2005, ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005..

[4]  Chi-Ping Hsu,et al.  General River Routing Algorithm , 1983, 20th Design Automation Conference Proceedings.

[5]  Yao-Wen Chang,et al.  Flip-chip routing with unified area-I/O pad assignments for package-board co-design , 2009, 2009 46th ACM/IEEE Design Automation Conference.

[6]  Yao-Wen Chang,et al.  An Integer Linear Programming Based Routing Algorithm for Flip-Chip Design , 2007, 2007 44th ACM/IEEE Design Automation Conference.

[7]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[8]  Chandra Tan,et al.  An intrinsic area-array pad router for ICs , 1997, Proceedings. Tenth Annual IEEE International ASIC Conference and Exhibit (Cat. No.97TH8334).

[9]  Atsushi Takahashi,et al.  Monotonic parallel and orthogonal routing for single-layer ball grid array packages , 2006, Asia and South Pacific Conference on Design Automation, 2006..

[10]  Zhi-Wei Chen,et al.  IO connection assignment and RDL routing for flip-chip designs , 2009, ASP-DAC 2009.

[11]  Zhi-Wei Chen,et al.  RDL pre-assignment routing for flip-chip designs , 2009, GLSVLSI '09.

[12]  Jin-Tai Yan,et al.  Top-down-based timing-driven steiner tree construction with wire sizing and buffer insertion , 2007, TENCON 2007 - 2007 IEEE Region 10 Conference.

[13]  P. Dehkordi,et al.  Design for packageability-the impact of bonding technology on the size and layout of VLSI dies , 1993, Proceedings 1993 IEEE Multi-Chip Module Conference MCMC-93.

[14]  Yao-Wen Chang,et al.  Area-I/O flip-chip routing for chip-package co-design , 2008, ICCAD 2008.