CAFE router: A fast connectivity aware multiple nets routing algorithm for routing grid with obstacles

In this paper, we propose CAFE router which obtains routes of multiple nets with target wire lengths for single layer routing grid with obstacles. CAFE router extends the route of each net from a pin to the other pin greedily so that the wire length of the net approaches its target wire length. Experiments show that CAFE router obtains the routes of nets with small length error in short time.

[1]  Martin D. F. Wong,et al.  Algorithmic study of single-layer bus routing for high-speed boards , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[2]  Martin D. F. Wong,et al.  A Length-Matching Routing Algorithm for High-Performance Printed Circuit Boards , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[3]  Martin D. F. Wong,et al.  Ordered escape routing based on Boolean satisfiability , 2008, 2008 Asia and South Pacific Design Automation Conference.

[4]  Martin D. F. Wong,et al.  On using SAT to ordered escape problems , 2009, 2009 Asia and South Pacific Design Automation Conference.

[5]  Kajitani Yoji.  The Potential Router , 2007 .

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7]  Tan Yan,et al.  Untangling twisted nets for bus routing , 2007, ICCAD 2007.

[8]  Ron Y. Pinter,et al.  On Routing Two-Point Nets Across a Channel , 1982, 19th Design Automation Conference.

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

[10]  Atsushi Takahashi,et al.  A Fast Longer Path Algorithm for Routing Grid with Obstacles Using Biconnectivity Based Length Upper Bound , 2009 .

[11]  Inagi Masato,et al.  Escape Fitting between a Pair of Pin-Sets , 2007 .