By Topic

An exact algorithm for single-layer wire length minimization

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

3 Author(s)
Ho, J.-M. ; Northwestern Univ., Evanston, IL, USA ; Suzuki, A. ; Sarrafzadeh, M.

An arbitrary single-layer detailed routine L of a set of two-terminal nets is considered. The necessary and sufficient condition for a layout to have minimum length under homotopic transformations (i.e. without changing the given global routing) is presented. Based on the proposed classification and the motion of line-segment visibility, an exact algorithm that minimizes the total wire length of L is given. The proposed algorithm runs in O(n2) time, where n is the number of bends in L

Published in:

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