9th International Symposium on Quality Electronic Design (isqed 2008) A Randomized Greedy Algorithm for the Pattern Fill Problem for DFM Applications March 17-March 19 ISBN: 978-0-7695-3117-5
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISQED.2008.29
This work deals with the dummy fill and negative fill insertion problem with constraints on the minimum and maximum pattern density within a moving rectangular window. It is shown that the general class of such problems is at least NP-hard. A greedy randomized algorithm for this problem is proposed, and its proof of convergence and some experimental results are presented. More detailed account of our implementation and results are available in [7].
Citation:
Maharaj Mukherjee, Kanad Chakraborty, "A Randomized Greedy Algorithm for the Pattern Fill Problem for DFM Applications," isqed, pp.344-347, 9th International Symposium on Quality Electronic Design (isqed 2008), 2008 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||