By Topic

Pin assignment with global routing

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
$31 $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

1 Author(s)
Cong, J. ; Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA

An algorithm is presented which combines the pin assignment step and the global routing step in the physical design of VLSI circuits. The algorithm is based on two key theorems: the channel pin arrangement theorem and the finite interval decomposition theorem. These two theorems enable the author to deal successfully with the high complexity resulting from combining the pin assignment and global routing steps. According to these two theorems, the author need only generate a coarse pin assignment and global routing topology. The exact pin locations and global solution can later be determined optimally and by a linear time algorithm. The author implemented a pin assignment and global routing package named BeauticianGR based on the proposed algorithm.<>

Published in:

Computer-Aided Design, 1989. ICCAD-89. Digest of Technical Papers., 1989 IEEE International Conference on

Date of Conference:

5-9 Nov. 1989