By Topic

A new generalized row-based global router

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
W. Swartz ; Dept. of Electr. Eng., Washington Univ., Seattle, WA, USA ; C. Sechen

This paper presents a new generalized row-based global router suitable for standard cell, gate-array, and sea-of-gates integrated circuits. It is the first row-based global router to explicitly minimize chip area. This global router uses adaptive Steiner trees to minimize chip area. The results were vastly improved over typical minimum wire length Steiner trees. This global router automatically adapts to technologies. In addition, optimal feedthrough placement is accomplished using linear assignment. Throughout the algorithm, timing constraints are taken into account. Also, a unique vertical constraint cycle minimization step eases the task for LEA channel routers. Finally, it is shown that this global router outperforms other global routers for all of the MCNC benchmark circuits which were tested.

Published in:

Computer-Aided Design, 1993. ICCAD-93. Digest of Technical Papers., 1993 IEEE/ACM International Conference on

Date of Conference:

7-11 Nov. 1993