Robust gate sizing by geometric programming

Abstract

We present an efficient optimization scheme for gate sizing in the presence of process variations. Using a posynomial delay model, the delay constraints are modified to incorporate uncertainty in the transistor widths and effective channel lengths due to the process variations. An uncertainty ellipsoid method is used to model the random parameter variations. Spatial correlations of intra-die width and channel length variations are incorporated in the optimization procedure. The resulting optimization problem is relaxed to be a Geometric Program and is efficiently solved using convex optimization tools. The effectiveness of our robust gate sizing scheme is demonstrated by applying the optimization on the ISCAS '85 benchmark circuits and testing the optimized circuits by performing Monte Carlo simulations to model the process variations. By varying the size of the uncertainty ellipsoids, a trade-off between area and robustness is explored. Experimental results show that the timing yield of the robustly optimized circuits improves manifold over the traditional deterministically sized circuits. As compared to the worst-case design, the robust gate sizing solution having the same area, has fewer timing violations.

A Novel Approach for Variation Aware Power Minimization during Gate Sizing

“…Using these values and a new variation parameter A the fuzzy optimization problem is transformed into a crisp nonlinear programming problem using -the symmetric relaxation method [2]. The crisp nonlinear problem for gate sizing in the presence of process variations is given by, into n areas as in [16] and gates in the same block will have same variation range. Eventhough, the parameter A can take any values between 0 and 1, for the gate sizing problem, it can be easily bounded to a smaller value.…”

A methodology for timing model characterization for statistical static timing analysis

“…To capture accurately large-range parametric variations, second order SSTA algorithms [3,4] have also been proposed, which are based upon more accurate quadratic timing models. By exploiting a statistical timing engine, statistical optimization techniques have also been proposed [6,7,8].…”

Variability driven gate sizing for binning yield optimization

“…Many researchers have investigated the gate sizing problem from a fabrication-variability perspective [1,4,8,10,11,12,14]. These approaches could be grouped into worst case approaches [8], sensitivity-based approaches [1,4,12,10], and the ones based on a mathematical programming model [11,14].…”

“…These approaches could be grouped into worst case approaches [8], sensitivity-based approaches [1,4,12,10], and the ones based on a mathematical programming model [11,14]. These approaches address different objectives under variability.…”