Convexity-based algorithms for design centering

A new technique for design centering and polytope approximation of the feasible region for a design are presented. In the first phase, the feasible region is approximated by a convex polytope, using a method based on a theorem on convex sets. As a natural consequence of this approach, a good approximation to the design center is obtained. In the next phase, the exact design center is estimated using one of two techniques that we present in this paper. The first inscribes the largest Hessian ellipsoid, which is known to be a good approximation to the shape of the polytope, within the polytope. This represents an improvement over previous methods, such as simplicial approximation, where a hypersphere or a crudely estimated ellipsoid is inscribed within the approximating polytope. However, when the probability density functions of the design parameters are known, the design center does not necessarily correspond to the center of the largest inscribed ellipsoid. Hence, a second technique is developed that incorporates the probability distributions of the parameters, under the assumption that their variation is modeled by Gaussian probability distributions. The problem is formulated as a convex programming problem and an efficient algorithm is used to calculate the design center, using fast and efficient Monte Carlo methods to estimate the yield gradient. An example is provided to illustrate how ellipsoid-based methods fail to incorporate the probability density functions and is solved using the convex programming-based algorithm. >

[1]  K. Singhal,et al.  Statistical design centering and tolerancing using parametric sampling , 1981 .

[2]  John W. Bandler,et al.  A nonlinear programming approach to optimal design centering, tolerancing, and tuning , 1976 .

[3]  David G. Luenberger,et al.  Linear and nonlinear programming , 1984 .

[4]  Robert G. Meyer,et al.  Analysis and Design of Analog Integrated Circuits , 1993 .

[5]  M.L. Liou,et al.  Computer-aided analysis of electronic circuits: Algorithms and computational techniques , 1977, Proceedings of the IEEE.

[6]  G. Hachtel.  The simplicial approximation approach to design centering , 1977 .

[7]  C. L. Liu,et al.  A new performance driven placement algorithm , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[8]  Wojciech Maly,et al.  VLSI Design for Manufacturing: Yield Enhancement , 1989 .

[9]  Peter Feldmann,et al.  Accurate and efficient evaluation of circuit yield and yield gradients , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[10]  Sung-Mo Kang,et al.  A Convex Programming Approach to Transistor Sizing , 1993 .

[11]  Jerome Sacks,et al.  Integrated circuit design optimization using a sequential strategy , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[12]  Hany L. Abdel-Malek,et al.  The ellipsoidal technique for design centering and region approximation , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[13]  Stochastic Programming,et al.  Logarithmic Concave Measures and Related Topics , 1980 .

[14]  Pravin M. Vaidya,et al.  A new algorithm for minimizing convex functions over convex sets , 1989, 30th Annual Symposium on Foundations of Computer Science.

[15]  Sung-Mo Kang,et al.  Feasible region approximation using convex polytopes , 1993, 1993 IEEE International Symposium on Circuits and Systems.

[16]  Sung-Mo Kang,et al.  An exact solution to the transistor sizing problem for CMOS circuits using convex optimization , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[17]  Sachin S. Sapatnekar,et al.  Convexity-based algorithms for design centering , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[18]  Sachin S. Sapatnekar,et al.  A convex optimization approach to transistor sizing for CMOS circuits , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.