B-escape: a simultaneous escape routing algorithm based on boundary routing

Authors:
Lijuan Luo;Tan Yan;Qiang Ma;Martin D.F. Wong;Toshiyuki Shibuya
Affiliations:
University of Illinois, Urbana, IL, USA;University of Illinois, Urbana, IL, USA;University of Illinois, Urbana, IL, USA;University of Illinois, Urbana, IL, USA;Fujitsu Laboratories of America, Inc., Sunnyvale, CA, USA
Venue:
Proceedings of the 19th international symposium on Physical design
Year:
2010

Citing 10
Cited 1

Single-layer fanout routing and routability analysis for Ball Grid Arrays

ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Efficient algorithms for finding disjoint paths in grids

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Simultaneous escape routing and layer assignment for dense PCBs

Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
Monotonic parallel and orthogonal routing for single-layer ball grid array packages

ASP-DAC '06 Proceedings of the 2006 Asia and South Pacific Design Automation Conference
A routing algorithm for flip-chip design

ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
Layer minimization of escape routing in area array packaging

Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
An integer linear programming based routing algorithm for flip-chip design

Proceedings of the 44th annual Design Automation Conference
Ordered escape routing based on Boolean satisfiability

Proceedings of the 2008 Asia and South Pacific Design Automation Conference
A correct network flow model for escape routing

Proceedings of the 46th Annual Design Automation Conference
Simultaneous Escape-Routing Algorithms for Via Minimization of High-Speed Boards

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Recent research development in PCB layout

Proceedings of the International Conference on Computer-Aided Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

Simultaneous escape routing on dense circuit boards is a very challenging task and great amount of manual effort is still needed in order to achieve high routability. In this paper, we present a new simultaneous escape routing algorithm which is based upon a novel boundary routing approach. Our algorithm can solve complicated escape problems in very short time. For a set of industrial escape problems, our algorithm successfully solved all of them while Cadence Allegro PCB router was only able to complete the routing of half of the problems.