First-order incremental block-based statistical timing analysis

Abstract

Variability in digital integrated circuits makes timing verification an extremely challenging task. In this paper, a canonical first order delay model is proposed that takes into account both correlated and independent randomness. A novel linear-time block-based statistical timing algorithm is employed to propagate timing quantities like arrival times and required arrival times through the timing graph in this canonical form. At the end of the statistical timing, the sensitivities of all timing quantities to each of the sources of variation are available. Excessive sensitivities can then be targeted by manual or automatic optimization methods to improve the robustness of the design. This paper also reports the first incremental statistical timer in the literature which is suitable for use in the inner loop of physical synthesis or other optimization programs. The third novel contribution of this paper is the computation of local and global criticality probabilities. For a very small cost in CPU time, the probability of each edge or node of the timing graph being critical is computed. Numerical results are presented on industrial ASIC chips with over two million logic gates.

A Layout-Aware Pattern Grading Procedure for Critical Paths Considering Power Supply Noise and Crosstalk

“…In this work critical paths are selected using static timing analysis (STA) tools based on the extracted parasitic information. However, statistical static timing analysis (SSTA) [20,21] considering process variations can also be used to select critical paths. To validate and analyze the accuracy and complexity of our proposed method, we perform our method over a number of patterns and compare its pattern grading results with that from the full-circuit fast-SPICE simulation.…”

Elastic Timing Scheme for Energy-Efficient and Robust Performance

“…This solver was run on a Linux machine with 2 dual-core Intel Xeon processors of 3.2GHz and 8G memory, and the corresponding CPU runtimes in seconds are reported in the third column of Table 3. The MILP solution chooses to shift the clock skew for certain flip-flops depending upon the objective function and constraints in (1)(2)(3)(4)(5)(6). Column 4 and column 5 of Table 3 show the number of flip-flops with skew shift and the maximum amount of shift.…”

“…Evidently, the efficiency of such power usage is poor. Recently, statistical methods [1,2,3,4] have been developed to reduce the pessimism of safety margins. However, large portions of the safety margins are still retained to guard against at least the near-worstcase variations.…”

Efficiently analyzing the impact of aging effects on large integrated circuits

“…The canonical gate model corresponds to the gate model used for statistical static timing analysis (SSTA) [19]:…”