Title
Convexity-based algorithms for design centering
Abstract
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
Year
DOI
Venue
1994
10.1109/43.331410
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Keywords
DocType
Volume
polytope approximation,design center,convex polytope,design parameter,gaussian probability distribution,approximating polytope,exact design center,convexity-based algorithm,feasible region,probability density function,good approximation
Journal
13
Issue
ISSN
ISBN
12
0278-0070
0-8186-4490-7
Citations 
PageRank 
References 
14
1.91
9
Authors
3
Name
Order
Citations
PageRank
S. S. Sapatnekar139627.16
P. M. Vaidya225967.95
Steve M. Kang3141.91