JiffyTune: circuit optimization using time-domain sensitivities

Automating the transistor and wire-sizing process is an important step toward being able to rapidly design high-performance, custom circuits. This paper presents a circuit optimization tool that automates the tuning task by means of state-of-the-art nonlinear optimization. It makes use of a fast circuit simulator and a general-purpose nonlinear optimization package. It includes minimax and power optimization, simultaneous transistor and wire tuning, general choices of objective functions and constraints, and recovery from nonworking circuits. In addition, the tool makes use of designer-friendly interfaces that automate the specification of the optimization task, the running of the optimizer, and the back-annotation of the results of optimization onto the circuit schematic. Particularly for large circuits, gradient computation is usually the bottleneck in the optimization procedure. In addition to traditional adjoint and direct methods, we use a technique called the adjoint Lagrangian method, which computes all the gradients necessary for one iteration of optimization in a single adjoint analysis. This paper describes the algorithms and the environment in which they are used and presents extensive circuit optimization results. A circuit with 6900 transistors, 4128 tunable transistors, and 60 independent parameters was optimized in about 108 min of CPU time on an IBM RISC/System 6000, model 590.

[1]  John A. Nelder,et al.  A Simplex Method for Function Minimization , 1965, Comput. J..

[2]  Philip E. Gill,et al.  Practical optimization , 1981 .

[3]  P. Toint,et al.  A globally convergent augmented Lagrangian algorithm for optimization with general constraints and simple bounds , 1991 .

[4]  Weitong Chuang,et al.  Power vs. delay in gate sizing: conflicting objectives? , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

[5]  M.D. Matson,et al.  Macromodeling and Optimization of Digital MOS VLSI Circuits , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[6]  Ronald A. Rohrer,et al.  Sensitivity computation in piecewise approximate circuit simulation , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  David Marple Transistor Size Optimization in the Tailor Layout System , 1989, 26th ACM/IEEE Design Automation Conference.

[8]  M. J. D. Powell,et al.  A method for nonlinear constraints in minimization problems , 1969 .

[9]  Clarence Zener,et al.  Geometric Programming : Theory and Application , 1967 .

[10]  Tuyen Van Nguyen Transient sensitivity computation and applications , 1991 .

[11]  Robert B. Hitchcock,et al.  Timing Analysis of Computer Hardware , 1982, IBM J. Res. Dev..

[12]  Paul Penfield,et al.  Signal Delay in RC Tree Networks , 1981, 18th Design Automation Conference.

[13]  Jason Cong,et al.  Simultaneous driver and wire sizing for performance and power optimization , 1994, IEEE Trans. Very Large Scale Integr. Syst..

[14]  Alberto L. Sangiovanni-Vincentelli,et al.  ECSTASY: a new environment for IC design optimization , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

[15]  Elizabeth Eskow,et al.  A New Modified Cholesky Factorization , 1990, SIAM J. Sci. Comput..

[16]  P. Toint,et al.  Global convergence of a class of trust region algorithms for optimization with simple bounds , 1988 .

[17]  Ronald A. Rohrer,et al.  Piecewise approximate circuit simulation , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[18]  Alberto L. Sangiovanni-Vincentelli,et al.  DELIGHT.SPICE: an optimization-based system for the design of integrated circuits , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[19]  Jorge J. Moré,et al.  Recent Developments in Algorithms and Software for Trust Region Methods , 1982, ISMP.

[20]  R. Rohrer The Generalized Adjoint Network and Network Sensitivities , 1969 .

[21]  Nicholas I. M. Gould,et al.  On the Number of Inner Iterations Per Outer Iteration of a Globally Convergent Algorithm for Optimization with General Nonlinear Inequality Constraints and Simple Bounds , 1997, Comput. Optim. Appl..

[22]  Ronald A. Rohrer,et al.  Electronic Circuit and System Simulation Methods , 1994 .

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

[24]  Ronald A. Rohrer,et al.  SPECS simulation validation with efficient transient sensitivity computation , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[25]  Ping Yang,et al.  Transient sensitivity computation for MOSFET circuits , 1985, IEEE Transactions on Electron Devices.

[26]  Nicholas I. M. Gould,et al.  An exact penalty function for semi-infinite programming , 1987, Math. Program..

[27]  G. D. Hachtel,et al.  Techniques for the optimal design and synthesis of switching circuits , 1967 .

[28]  A. Jimenez,et al.  Algorithms for ASTAP--A network-analysis program , 1973 .

[29]  Ross Baldick,et al.  A sequential quadratic programming approach to concurrent gate and wire sizing , 1997, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[30]  Ibrahim N. Hajj,et al.  Probabilistic simulation for reliability analysis of CMOS VLSI circuits , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[31]  M. Hestenes Multiplier and gradient methods , 1969 .

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

[33]  Andrew R. Conn,et al.  Two-Step Algorithms for Nonlinear Optimization with Structured Applications , 1999, SIAM J. Optim..

[34]  Nicholas I. M. Gould,et al.  CUTE: constrained and unconstrained testing environment , 1995, TOMS.

[35]  W. C. Elmore The Transient Response of Damped Linear Networks with Particular Regard to Wideband Amplifiers , 1948 .