By Topic

Optimal algorithms for planar over-the-cell routing in the presence of obstacles

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)
Danda, S.R. ; Dept. of Comput. Sci., Western Michigan Univ., Kalamazoo, MI, USA ; Madhwapathy, S. ; Sherwani, N.A.

In two layer standard cell design methodology, if both M1 and M2 layers are used for intra-cell routing, then the entire M2 layer will not be available for over-the-cell routing. In this case, the intra-cell routing segments in the M2 layer can be considered as obstacles, and the over-the-cell routing in the M2 layer has to be completed around these obstacles. In this paper, we present an optimal algorithm to solve the problem of planar over-the-cell routing in the presence of arbitrary shaped obstacles (PROBES), in O(Kn2) time, where K is the number of tracks on the over-the-cell area of a cell-row, and n is the number of nets. Our algorithm can be further extended, to solve PROBES optimally, when at most d doglegs are allowed for routing, in O(Kd+1nd+2) time, where d⩾0 is a constant

Published in:

VLSI Design, 1995., Proceedings of the 8th International Conference on

Date of Conference:

4-7 Jan 1995