By Topic

On minimizing the number of L-shaped channels in building-block layout [VLSI]

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)
Y. Cai ; Dept. of Comput. Sci., Texas Univ., Austin, TX, USA ; D. F. Wong

Given a building-block layout of rectangular modules, the routing area is to be decomposed into straight and L-shaped channels and routed in a certain order. Since straight channels are easier to route and channel routers usually produce near-optimal results, it is desirable to minimize the number of L-shaped channels used in such a decomposition. An algorithm for minimizing the number of L-shaped channels used in the routing area decomposition is presented. The algorithm is based on a careful study of the structure of layouts of rectangular modules and a transformation of the original problem to a graph theoretical problem. For examples of up to 136 channels, the algorithm took less than one tenth of a second on a SUN SPARC station 1 to finish the computation and obtained up to 29% reduction in the mumber of L-shaped channels over the results produced by the algorithm of W.M. Dai et al. (1985)

Published in:

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