Filling and Scotting: Analysis and Algorithms

Authors:Kahng, A, Department of Computer ScienceUniversity of Virginia Robins, G, Department of Computer ScienceUniversity of Virginia Singh, A, Department of Computer ScienceUniversity of Virginia Wang, H, Department of Computer ScienceUniversity of Virginia Zelikovsky, A, Department of Computer ScienceUniversity of Virginia

In very deep-submicron VLSI, certain manufacturing steps – notably optical exposure, resist development and etch, chemical vapor deposition and chemical-mechanical polishing (CMP)– have varying effects on device and interconnect features depending on local characteristics of the layout. To make these effects uniform and predictable, the layout itself must be made uniform with respect to certain density parameters. Traditionally, only foundries have performed the post-processing needed to achieve this uniformity, via insertion ("filling") or partial deletion ("slotting") of features in the layout. Today, however, physical design and verification tools cannot remain oblivious to such foundry post-processing. Without an accurate estimate of the filling and slotting, RC extraction, delay calculation, and timing and noise analysis flows will all suffer from wild inaccuracies. Therefore, future placeand-route tools must efficiently perform filling and slotting prior to performance analysis within the layout optimization loop. We give the first formulations of the filling and slotting problems that arise in layout post-processing or layout optimization for manufacturability. Such formulations seek to add or remove features to a given process layer, so that the local area or perimeter density of features satisfies prescribed upper and lower bounds in all windows of a given size. We also present efficient algorithms for density analysis as well as for filling/slotting synthesis. Our work provides a new unification between manufacturing and physical design, and captures a number of general requirements imposed on layout by the manufacturing process.
Note: Abstract extracted from PDF text

All rights reserved (no additional license for public reuse)
Source Citation:

Kahng, A, G Robins, A Singh, H Wang, and A Zelikovsky. "Filling and Scotting: Analysis and Algorithms." University of Virginia Dept. of Computer Science Tech Report (1997).

University of Virginia, Department of Computer Science
Published Date: