Circuit optimization via adjoint Lagrangians
- 1 January 1997
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The circuit tuning problem is best approached by means of gradient-based nonlinear optimization algorithms. For large circuits, gradient computation can be the bottleneck in the optimization procedure. Traditionally, when the number of measurements is large relative to the number of tunable parameters, the direct method is used to repeatedly solve the associated sensitivity circuit to obtain all the necessary gradients. Likewise, when the parameters outnumber the measurements, the adjoint method is employed to solve the adjoint circuit repeatedly for each measurement to compute the sensitivities. In this paper we propose the adjoint Lagrangian method, which computes all the gradients necessary for augmented-Lagrangian-based optimization in a single adjoint analysis. After the nominal simulation of the circuit has been carried out, the gradients of the merit function are expressed as the gradients of a weighted sum of circuit measurements. The weights are dependent on the nominal solution and on optimizer quantities such as Lagrange multipliers. By suitably choosing the excitations of the adjoint circuit, the gradients of the merit function are computed via a single adjoint analysis, irrespective of the number of measurements and the number of parameters of the optimization. This procedure requires close integration between the nonlinear optimization software and the circuit simulation program.Keywords
This publication has 21 references indexed in Scilit:
- ECSTASY: a new environment for IC design optimizationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Optimization of custom MOS circuits by transistor sizingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Power vs. delay in gate sizing: conflicting objectives?Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A sequential quadratic programming approach to concurrent gate and wire sizingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple BoundsSIAM Journal on Numerical Analysis, 1988
- DELIGHT.SPICE: an optimization-based system for the design of integrated circuitsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1988
- Macromodeling and Optimization of Digital MOS VLSI CircuitsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1986
- Computation of delay time sensitivities for use in time domain optimizationIEEE Transactions on Circuits and Systems, 1975
- The Sparse Tableau Approach to Network Analysis and DesignIEEE Transactions on Circuit Theory, 1971
- Multiplier and gradient methodsJournal of Optimization Theory and Applications, 1969