CAFE router: A fast connectivity aware multiple nets routing algorithm for routing grid with obstacles | IEEE Conference Publication | IEEE Xplore

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


Abstract:

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...Show More

Abstract:

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.
Date of Conference: 18-21 January 2010
Date Added to IEEE Xplore: 25 February 2010
ISBN Information:

ISSN Information:

Conference Location: Taipei, Taiwan
School of Computer Science and Engineering, University of Aizu, Japan
Division of Electrical, Electronic and Information Engineering, Osaka University, Japan

School of Computer Science and Engineering, University of Aizu, Japan
Division of Electrical, Electronic and Information Engineering, Osaka University, Japan

Contact IEEE to Subscribe

References

References is not available for this document.