DocumentCode
3406144
Title
Convexity-based algorithms for design centering
Author
Sapatnekar, S.S. ; Vaidya, P.M. ; Kang, S.M.
Author_Institution
Dept. of EE&CE, Iowa State Univ., Ames, IA, USA
fYear
1993
fDate
7-11 Nov. 1993
Firstpage
206
Lastpage
209
Abstract
Two new geometrical algorithms for design centering are presented. In each case, the feasible region is first approximated by a convex polytope. The first algorithm inscribes the largest Hessian ellipsoid within the approximating polytope. The second assumes Gaussian parameter distributions, formulates the problem as a convex programming problem, and uses an efficient algorithm to perform the optimization.
Keywords
convex programming; Gaussian parameter distributions; approximating polytope; convex polytope; convex programming problem; design centering; geometrical algorithms; largest Hessian ellipsoid; optimization; Algorithm design and analysis; Bandwidth; Circuits; Delay; Design optimization; Ellipsoids; Manufacturing processes; Monte Carlo methods; Probability distribution; Shape;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer-Aided Design, 1993. ICCAD-93. Digest of Technical Papers., 1993 IEEE/ACM International Conference on
Conference_Location
Santa Clara, CA, USA
Print_ISBN
0-8186-4490-7
Type
conf
DOI
10.1109/ICCAD.1993.580057
Filename
580057
Link To Document