Convexity-based algorithms for design centering

A new technique for design centering, and for polytope approximation of the feasible region for a design are presented. In the rst 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 approximationto 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 rst 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 pdf's 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, which...

• Type: Conference
• Year: 1993
• Where: ICCAD
• Authors: Sachin S. Sapatnekar, Pravin M. Vaidya, Steve M. Kang
• Keywords: Convex Polytope, Design Center, Feasible Region, Hardware, ICCAD 1993