Statistical static timing analysis
Conventional static timing analysis (STA) has been a stock analysis algorithm for the design of digital circuits over the last 30 years. However, in recent years the increased variation in semiconductor devices and interconnect has introduced a number of issues that cannot be handled by traditional (deterministic) STA. This has led to considerable research into statistical static timing analysis,, which replaces the normal deterministic timing of gates and interconnects with probability distributions, and gives a distribution of possible circuit outcomes rather than a single outcome.
Why STA is popular
Old fashioned deterministic STA is popular for good reasons:
- It requires no vectors, so it does not miss paths
- Run time is linear in circuit size
- The result is conservative
- Can use some fairly simple libraries (typically delay and output slope as a function of input slope and output load).
- Easy to extend to incremental operation for use in optimization
Limits of STA
Methods of SSTA
There are two main methods - path based and block based.
Path based sums the delays on specific paths. The statistical calculation is simple, but someone or something has to pick the paths. There is always the risk that some other path may be relevent but not analyzed.
Block based generates the arrival times (and needed) times for each node, working forward 9and backward) from the clocked elements. The advantage is completeness, and no need for path selection. The biggest problem is that a statistical max (or min) operation that also consideres correlation is needed, which is a hard technical problem.