A Design Centering Algorithm for Nonconvex Regions of Acceptability

Random variations inherent in any fabrication process may result in very low production yield. This is especially true in the fabrication of integrated circuits. Several methods have been proposed to help the circuit designer minimize the influence of these random variations. Most of these methods are deterministic and try to maximize yield by centering the nominal value of the designable parameters in the so-called region of acceptability. However, these design centering techniques require an assumption of convexity which is not valid in many real design situations. To overcome this problem a new convergent method is proposed which is based on the sequential solution of subproblems for which the convexity assumption is valid. A practical implementation of the algorithm is shown by examples to be computationally efficient.

[1]  Jean-Pierre Crouzeix,et al.  On second order conditions for quasiconvexity , 1980, Math. Program..

[2]  G. Dantzig,et al.  On the continuity of the minimum set of a continuous function , 1967 .

[3]  Robert K. Brayton,et al.  Computation of delay time sensitivities for use in time domain optimization , 1975 .

[4]  Robert K. Brayton,et al.  The Sparse Tableau Approach to Network Analysis and Design , 1971 .

[5]  R. Brayton,et al.  Yield maximization and worst-case design with arbitrary statistical distributions , 1980 .

[6]  R. Rohrer,et al.  Automated Network Design-The Frequency-Domain Case , 1969 .

[7]  M. J. D. Powell,et al.  Algorithms for nonlinear constraints that use lagrangian functions , 1978, Math. Program..

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

[9]  Béla Martos,et al.  Subdefinite Matrices and Quadratic Forms , 1969 .

[10]  Robert K. Brayton,et al.  A new algorithm for statistical circuit design based on quasi-newton methods and function splitting , 1979 .

[11]  M. J. D. Powell,et al.  Variable Metric Methods for Constrained Optimization , 1982, ISMP.

[12]  Jacques A. Ferland,et al.  Maximal domains of quasi-convexity and pseudo-convexity for quadratic functions , 1972, Math. Program..

[13]  E. Polak,et al.  Theoretical and computational aspects of the optimal design centering, tolerancing, and tuning problem , 1979 .

[14]  W. Zangwill.  Convergence Conditions for Nonlinear Programming Algorithms , 1969 .

[15]  Frank H. Clarke,et al.  A New Approach to Lagrange Multipliers , 1976, Math. Oper. Res..

[16]  John W. Bandler,et al.  Worst Case Network Tolerance Optimization , 1975 .

[17]  E. Butler,et al.  Realistic Design Using Large-Change Sensitivities and Performance Contours , 1971 .

[18]  Béla Martos,et al.  Quadratic Programming with a Quasiconvex Objective Function , 1971, Oper. Res..

[19]  Jacques A. Ferland,et al.  MATRIX-THEORETIC CRITERIA FOR THE QUASI-CONVEXITY AND PSEUDO-CONVEXITY OF QUADRATIC FUNCTIONS. , 1972 .