By Topic

Comments on "Filling algorithms and analyses for layout density control"

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

1 Author(s)
Rung-Bin Lin ; Dept. of Comput. Eng. & Sci., Yuan Ze Univ., Chung-li, Taiwan

Theorem 2 of the title paper (A.B. Kahng et al., ibid. vol. 18, pp.445-462, 1999) presents layout density bounds for any fixed r-dissection w-by-w window given the layout density of at least L and at most U for all w-by-w windows whose bottom left corners are at points (i(w/r), j(w/r)), i, j=0, 1, ..., r((n/w)-1) on an n-by-n layout plane. However, the bounds are not tight for certain combinations of U (L) and r. Here, the authors present an approach to obtaining the tight lower and upper bounds for all possible combinations of U (L) and r.

Published in:

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