Closing the Smoothness and Uniformity Gap in Area Fill Synthesis

About This Presentation
Title:

Closing the Smoothness and Uniformity Gap in Area Fill Synthesis

Description:

Closing the Smoothness and Uniformity Gap in Area Fill Synthesis ... Use dummy features to improve layout uniformity for CMP process. w. w/r. tile ... –

Number of Views:67
Avg rating:3.0/5.0
Slides: 10
Provided by: yuc85
Category:

less

Transcript and Presenter's Notes

Title: Closing the Smoothness and Uniformity Gap in Area Fill Synthesis


1
Closing the Smoothness and Uniformity Gap in Area
Fill Synthesis
Supported by Cadence Design Systems, Inc., NSF,
the Packard Foundation, and State of Georgias
Yamacraw Initiative
Y. Chen, A. B. Kahng, G. Robins, A. Zelikovsky
(UCLA, UCSD, UVA and GSU) http//vlsicad.ucsd.ed
u
2
Fixed-Dissection Fill Problem
  • Use dummy features to improve layout uniformity
    for CMP process
  • Fixed-Dissection Fill Problem
  • given
  • rule-correct layout in n ? n region
  • upper bound U on density
  • partition layout into nr/w ? nr/w fixed
    dissections
  • monitor only fixed set of windows consisting of
    r2 tiles
  • fill layout subject to given constraints w.r.t.
    Min-Var or Min-Fill objective

3
The Smoothness Gap
  • Fixed-dissection analysis ? floating window
    analysis
  • Fill result will not satisfy the given bounds
  • Despite this gap (observed in 1998), all
    published filling methods fail to consider this
    smoothness gap

4
Accurate Layout Density Analysis
  • Optimal extremal-density analysis with complexity
  • inefficient
  • Multi-level density analysis algorithm
  • any arbitrary window contains some shrunk on-grid
    window
  • any arbitrary window is contained in some bloated
    on-grid window

5
Smoothness Gap in Existing Methods
  • Window density variation and violation of max
    window density in fixed-dissection filling are
    underestimated

6
Local Density Variations
  • Type I max density variation of every r
    neighboring windows in each row of the
    fixed-dissection

7
Linear Programming Formulations
  • Lipschitz Types

with
  • Combined Objective
  • linear summation of Min-Var, Lip-I and Lip-II
    objectives with specific coefficients
  • add Lip-I and Lip-II constraints as well as

8
Computational Experience
  • Solutions with best Min-Var objective value do
    not always have the best value in terms of local
    smoothness
  • LP with combined objective achieves best
    comprehensive solutions

9
Thank you!
Write a Comment
User Comments (0)
About PowerShow.com