Ordered escape routing using network flow and optimization model
Authors:
- 1 February 2015
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 563-568
Abstract
With the advancement in technology, BGA based integrated circuits for robotics and other devices are being prepared in small sizes with more pin count. This increase in number requires more number of pins to be escaped from the inner side of the IC towards the escape boundary. Ordered escape routing is very important due to its great impact on area and length routing at later stage. Basic design rules of planarity and capacity along with constraints like length matching make the ordered escape routing problem more difficult. In this paper we formulate flow model on the basis of inter-pin capacity. Using flow model we propose optimization model that solves ordered escape routing problem under design constraints. Evaluation of model using randomly generated examples shows that maximum possible nets are being routed by the model.Keywords
This publication has 7 references indexed in Scilit:
- Mixed-Crossing-Avoided Escape Routing of Mixed-Pattern Signals on Staggered-Pin-Array PCBsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2014
- Escape Routing for Staggered-Pin-Array PCBsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2013
- A correct network flow model for escape routing2009
- Modern IC packaging trends and their reliability implicationsMicroelectronics Reliability, 2006
- Development of a new improved high performance flip chip BGA package2004
- The NEOS ServerIEEE Computational Science and Engineering, 1998
- On finding non-intersecting straightline connections of grid points to the boundaryJournal of Algorithms, 1992