IO connection assignment and RDL routing for flip-chip designs
Authors:
- 1 January 2009
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21536961,p. 588-593
Abstract
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.Keywords
This publication has 5 references indexed in Scilit:
- An Integer Linear Programming Based Routing Algorithm for Flip-Chip DesignProceedings of the 39th conference on Design automation - DAC '02, 2007
- Monotonic parallel and orthogonal routing for single-layer ball grid array packages2006
- Dynamic tree reconstruction with application to timing-constrained congestion-driven global routingIEE Proceedings - Computers and Digital Techniques, 2006
- Design for packageability-the impact of bonding technology on the size and layout of VLSI dies2002
- Computational Geometry1997