Statistical Static Timing Analysis: How simple can we get - PowerPoint PPT Presentation

1 / 28
About This Presentation
Title:

Statistical Static Timing Analysis: How simple can we get

Description:

Statistical Static Timing Analysis: How simple can we get – PowerPoint PPT presentation

Number of Views:123
Avg rating:3.0/5.0
Slides: 29
Provided by: chiray2
Category:

less

Transcript and Presenter's Notes

Title: Statistical Static Timing Analysis: How simple can we get


1
Statistical Static Timing AnalysisHow simple
can we get?
  • Chirayu Amin, Noel Menezes,
  • Kip Killpack, Florentin Dartu,
  • Umakanta Choudhury, Nagib Hakim,
  • Yehea Ismail

ECE Department Northwestern University Evanston
, IL 60208, USA
Intel Corporation, Hillsboro, OR 97124, USA
2
Outline
  • Introduction
  • Process Variation Model
  • Distributions
  • Cell-library characterization
  • Methodology
  • Path-based
  • Add/Max Operations
  • Results
  • Conclusions

3
Variations and their impact
  • Sources of Timing Variations
  • Channel Length
  • Dopant Atom Count
  • Oxide Thickness
  • Dielectric Thickness
  • Vcc
  • Temperature
  • Influence
  • Performance yield prediction
  • Optimization
  • Design convergence
  • Management (traditional)
  • Corner based analysis
  • Sub-optimum

4
Recent solutions
  • Categories
  • Block-based pdf propagation
  • Non-incremental
  • Incremental
  • Path-based pdf propagation
  • Bound calculation
  • Generic path analysis
  • Complexity
  • Non-gaussian/Non-linear pdf propagation
  • Statistical MAX operation
  • Correlations
  • Reconvergence

5
Factors influencing solutions
  • Predicting performance yield oroptimizing
    circuit?
  • Underlying process characteristics
  • How significant are the variation sources?
  • How significant is each component?
  • Die-to-die / Within-die
  • Channel length, Threshold voltage, etc
  • Architecuture and Layout
  • Number of stages between flip-flops
  • Spatial arrangement of gates

6
SSTA targets
  • Performance yield prediction
  • Die-to-die effects are more important
  • Can be handled using a different methodology
  • Design convergence
  • Affected primarily by within-die effects
  • Gates delay w.r.t. others on the same die

Presented work addresses design convergence
7
Outline
  • Introduction
  • Process Variation Model
  • Distributions
  • Cell-library characterization
  • Methodology
  • Path-based
  • Add/Max Operations
  • Results
  • Conclusions

8
Modeling variations
  • Only within-die effects considered

Variations
Main variations affecting delay le and vt
9
Parameter distributions
  • Gaussian distributions for les, ler, vtr
  • Characterized by ?les, ?ler, ?vtr
  • Systematic variation for les
  • Correlation is a function of distance

16 S. Samaan, ICCAD 04
10
Cell-library characterization
  • Simulations similar as for deterministic STA
  • Plus extra simulations for measuring ?delay

delay delaynom(lenom,vtnom,tt,CL)
? delayles(les,tt,CL) ? delayler(ler,tt,CL)
? delayvtr(vtr,tt,CL)
? 2delay ? 2delay,les(? 2les,tt,CL) ?
2delay,ler (?2ler,tt,CL) ? 2delay,vtr
(?2vtr,tt,CL)
Overall delay variance is the sum of variances
due to les, ler, and vtr
11
Measuring ?delay
  • Characterization of ?delay,les
  • Vary le similarly for all transistors in the cell
    (?1)
  • Measure delay change for each input to output arc
  • Characterization of ?delay,ler and ?delay,vtr
  • Sample using Monte Carlo method
  • Each transistor sampled independently
  • Measure delay change for each input to output arc

12
Outline
  • Introduction
  • Process Variation Model
  • Distributions
  • Cell-library characterization
  • Methodology
  • Path-based
  • Add/Max Operations
  • Results
  • Conclusions

13
Variation effects on a path
  • Systematic variations
  • Additive effect
  • (?/?)path-delay (?/?)cell-delay
  • Spatial effect
  • Paths close together have very similar delay
    variation
  • Random variations
  • Cancellation effect
  • Variations die out as long as there are enough
    stages
  • (?/?)path-delay (1/sqrt(n))(?/?)cell-delay
  • ITRS projections n12 stages

14
Paths converging on a flip-flop
  • Distribution of delay for each path known
  • From simple path-based analysis
  • Distribution of overall margin at flip-flop?
  • Statistical MAX operation!

15
Statistical MAX operation
1
3
MAX is complicated
MAX is trivial
2
4
16
Comments about MAX
  • Path-delays are highly correlated
  • Sigmas are similar
  • Random componentsdie out due to depth

No need for a complicated MAX operation!!
17
Path-based SSTA methodology
Main Idea Calculate the timing-margin
distribution, for each path ending at a flip-flop
or a primary output (PO)
18
Calculating margin distribution
margin tcs T - tCGD ? 2margin? 2CS ? 2CGD
- 2? cov(tCS,tCGD)
includes tsetup
path CGD
  • ?CS delay sigma for path CS
  • ?CGD delay sigma for path CGD
  • cov(tCS,tCGD) covariance between delays of CS
    and CGD

path CS
Above analysis requires calculating delay
variances and covariances for paths ? Statistical
ADD operation
19
Statistical ADD
  • Path delay variance is the sum of delay variances
    due to les, ler, and vtr

? 2path-delay ? 2path-delay,les ?
2path-delay,ler ? 2path-delay,vtr
20
Path-delay covariance
  • Easy to calculate based on pair-wise covariances
    between individual gates

21
Outline
  • Introduction
  • Process Variation Model
  • Distributions
  • Cell-library characterization
  • Methodology
  • Path-based
  • Add/Max Operations
  • Results
  • Conclusions

22
Results
  • Methodology applied to a large microprocessor
    block
  • More than 100K cells
  • 90 nm technology
  • Fully extracted parasitics
  • Block-based (BFS) analysis to identify topN
    critical end-nodes (flop inputs, POs)
  • Critical paths identified by back-tracking
  • Path-based SSTA performed on the critical paths
  • Comparison with Monte Carlo Analysis

23
Monte Carlo
  • 600 dies (profiles) for varying les, ler, and vtr
  • Number depends on correlation distance, block
    size, etc
  • Full block-based analysis (BFS)
  • Not just on critical paths
  • Deterministic STA on each of the generated 600
    dies

les
ler and vtr
16 S. Samaan, ICCAD 04
24
Comparison with Monte Carlo
Good correlation with Monte Carlo Results!
25
Analysis
  • Error in predicting sigma
  • Maximum 6.6 of FO4 delay
  • Average 0.19 of the path delay
  • Monte Carlo showed that distributionsof margins
    are Gaussian
  • At each end-node
  • Only one or two paths were clearly showing up
    asworst paths on 80 of Monte Carlo samples
  • Relative ordering of paths ending up at a
    nodedoes not change

26
Outline
  • Introduction
  • Process Variation Model
  • Distributions
  • Cell-library characterization
  • Methodology
  • Path-based
  • Add/Max Operations
  • Results
  • Conclusions

27
Conclusions
  • Statistical timing is important
  • Simple path-based algorithmcan be adequate
  • Justified based on design, variation profiles
  • Distributions are Gaussian
  • Errors in estimating sigmaare acceptable

28
Q A
Write a Comment
User Comments (0)
About PowerShow.com