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.
Methods of SSTA
There are two main categories of SSTA algorithms - path-based and block-based methods.
A path-based algorithm[1] sums gate and wire delays on specific paths. The statistical calculation is
simple, but the paths of interest must be identified prior to running the analysis. There is the potential
that some other paths may be relevant but not analyzed so path selection is important.
A block-based algorithm[2] generates the arrival times (and required) times for each node, working
forward (and 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
considered correlation is needed, which is a hard technical problem..