By Topic

A lower bound on channel density after 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)
Mowchenko, J.T. ; Dept. of Electr. Eng., Alberta Univ., Edmonton, Alta., Canada

The author addresses the minimum density switchable segment assignment (MINDESSA) problem, which arises during the global routing of standard cell integrated circuits. A switchable segment is a portion of a net that can be routed in one of two adjacent channels. The MINDESSA problem is the problem of assigning switchable segments to one of the two possible channels so that the total channel density of the IC is minimized. The author presents an algorithm for calculating a lower bound on channel density for the MINDESSA problem

Published in:

Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on  (Volume:8 ,  Issue: 5 )