The DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.
Optimal design of a CMOS op-amp via geometric programming
Abstract
We describe a new method for determining component values and transistor dimensions for CMOS operational amplifiers (op-amps). We observe that a wide variety of design objectives and constraints have a special form, i.e., they are posynomial functions of the design variables. As a result, the amplifier design problem can be expressed as a special form of optimization problem called geometric programming, for which very efficient global optimization methods have been developed. As a consequence we can efficiently determine globally optimal amplifier designs or globally optimal tradeoffs among competing performance measures such as power, open-loop gain, and bandwidth. Our method, therefore, yields completely automated sizing of (globally) optimal CMOS amplifiers, directly from specifications. In this paper, we apply this method to a specific widely used operational amplifier architecture, showing in detail how to formulate the design problem as a geometric program. We compute globally optimal tradeoff curves relating performance measures such as power dissipation, unity-gain bandwidth, and open-loop gain. We show how the method can he used to size robust designs, i.e., designs guaranteed to meet the specifications for a variety of process conditions and parameters.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Interior-Point Polynomial Algorithms in Convex Programming
Nesterov, Y., & Nemirovskii, A. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970791 · Cited by 4,334
Physics of Semiconductor Devices: Proceedings of the Fourth International Workshop
JAIN, S. C., & RADHAKRISHNA, S. (1987) · Physics of Semiconductor Devices · doi:10.1142/9789814542012 · Cited by 4,151
Analysis and Design of Analog Integrated Circuits
Betts, W. R. (1978) · Electronics and Power · doi:10.1049/ep.1978.0296 · Cited by 3,827
Analysis and Design of Analog Integrated Circuits
Gray, P. R., & Meyer, R. G. (1977) · Cited by 3,487
Introduction to Operations Research
Leimkuhler, F. F. (1968) · Technometrics · doi:10.1080/00401706.1968.10490578 · Cited by 3,405
(1988) · Integration · doi:10.1016/0167-9260(88)90044-2 · Cited by 3,205
Simulated annealing: theory and applications.
(1988) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(88)90023-7 · Cited by 2,966
Analog Integrated Circuit Design
Carusone, A. C., Johns, D. A., & Martin, K. W. (1996) · Cited by 2,509
Primal-Dual Interior-Point Methods
Wright, S. J. (1997) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971453 · Cited by 2,391
Simulated Annealing: Theory and Applications
van Laarhoven, P. J. M., & Aarts, E. H. L. (1987) · Springer eBooks · doi:10.1007/978-94-015-7744-1 · Cited by 2,385
Nonlinear Programming: Sequential Unconstrained Minimization Techniques
Fiacco, A. V., & McCormick, G. P. (1968) · Defense Technical Information Center (DTIC) · Cited by 2,262
Analog integrated circuit design
Hurst, S. L. (1998) · Microelectronics Journal · doi:10.1016/s0026-2692(97)00051-7 · Cited by 1,732
Linear Programming: Foundations and Extensions
Vanderbei, R. J. (1998) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600987 · Cited by 921
Design of analog integrated circuits and systems
(1995) · Choice Reviews Online · doi:10.5860/choice.32-2760 · Cited by 862
Analog MOS Integrated Circuits for Signal Processing
Gregorian, R., & Temes, G. C. (1986) · CERN Document Server (European Organization for Nuclear Research) · Cited by 810
Analog MOS integrated circuits for signal processing
Sedra, A. S. (1987) · Proceedings of the IEEE · doi:10.1109/proc.1987.13922 · Cited by 761
Geometric Programming : Theory and Application
Duffin, R. J., Peterson, E. L., & Zener, C. M. (1967) · Cited by 604
TILOS: A Posynomial Programming Approach to Transistor Sizing
Fishburn, J. P., & Dunlop, A. E. (2003) · Springer eBooks · doi:10.1007/978-1-4615-0292-0_23 · Cited by 557
User's Guide for NPSOL (Version 4.0): A Fortran Package for Nonlinear Programming.
Gill, P. E., Murray, W., Saunders, M. A., & Wright, M. H. (1986) · doi:10.21236/ada169115 · Cited by 523
An improved frequency compensation technique for CMOS operational amplifiers
Ahuja, B. K. (1983) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.1983.1052012 · Cited by 501
OASYS: a framework for analog circuit synthesis
Harjani, R., Rutenbar, R. A., & Carley, L. R. (1989) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.44506 · Cited by 431
OPASYN: a compiler for CMOS operational amplifiers
Koh, H. Y., Sequin, C. H., & Gray, P. R. (1990) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.46777 · Cited by 379
IDAC: an interactive design tool for analog CMOS circuits
Degrauwe, M. G. R., Nys, O., Dijkstra, E., Rijmenants, J., Bitz, S., Goffart, B. L. A. G., Vittoz, E. A., Cserveny, S., Meixenberger, C., van der Stappen, G., et al. (1987) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.1987.1052861 · Cited by 371
Synthesis of high-performance analog circuits in ASTRX/OBLX
Ochotta, E. S., Rutenbar, R. A., & Carley, L. R. (1996) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.489099 · Cited by 327
An exact solution to the transistor sizing problem for CMOS circuits using convex optimization
Sapatnekar, S. S., Rao, V. B., Vaidya, P. M., et al. (1993) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.248073 · Cited by 313
Conn, A. R., Gould, N. I. M., & Toint, P. L. (1992) · Springer Series in Computational Mathematics · doi:10.1007/978-3-662-12211-2 · Cited by 295
A survey of optimization techniques for integrated-circuit design
Brayton, R. K., Hachtel, G. D., & Sangiovanni-Vincentelli, A. L. (1981) · Proceedings of the IEEE · doi:10.1109/proc.1981.12170 · Cited by 256
Simulated Annealing for VLSI Design
Wong, M. D. F., Leong, H. W., & Liu, C. L. (1988) · Kluwer international series in engineering and computer science · doi:10.1007/978-1-4613-1677-0 · Cited by 246
A 1.8-V digital-audio sigma-delta modulator in 0.8-μm CMOS
Rabii, S., & Wooley, B. A. (1997) · IEEE Journal of Solid-State Circuits · doi:10.1109/4.585245 · Cited by 232
Geometric Programming: Methods, Computations and Applications
Ecker, J. G. (1980) · SIAM Review · doi:10.1137/1022058 · Cited by 189
Measurement and analysis of charge injection in MOS analog switches
Shieh, J.-H., Patil, M., & Sheu, B. J. (1987) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.1987.1052713 · Cited by 184
DARWIN: CMOS opamp synthesis by means of a genetic algorithm
Kruiskamp, W., & Leenaerts, D. M. W. (1995) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/217474.217566 · Cited by 181
Optimization-based transistor sizing
Shyu, J.-M., Sangiovanni-Vincentelli, A. L., Fishburn, J. P., & Dunlop, A. E. (1988) · IEEE Journal of Solid-State Circuits · doi:10.1109/4.1000 · Cited by 177
Optimization of inductor circuits via geometric programming
Hershenson, M. D. M., Mohan, S. S., Boyd, S., & Lee, T. H. (1999) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/309847.310112 · Cited by 154
Self-citationAn infeasible interior-point algorithm for solving primal and dual geometric programs
Kortanek, K. O., Xu, X., & Ye, Y. (1997) · Mathematical Programming · doi:10.1007/bf02614382 · Cited by 145
Linearizing Geometric Programs
Duffin, R. J. (1970) · SIAM Review · doi:10.1137/1012043 · Cited by 127
Solution of generalized geometric programs
Avriel, M., Dembo, R. S., & Passy, U. (1975) · International Journal for Numerical Methods in Engineering · doi:10.1002/nme.1620090112 · Cited by 123
A Statistical Optimization-based Approach For Automated Sizing Of Analog Cells
Medeiro, F., Fernandez, F. V., Domínguez-Castro, R., & Rodriguez-Vazquez, A. (1994) · International Conference on Computer Aided Design · doi:10.1109/iccad.1994.629881 · Cited by 81
FASY: a fuzzy-logic based tool for analog synthesis
Torralba, A., Chávez, J., & Franquelo, L. G. (1996) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.503939 · Cited by 73
DARWIN: CMOS opamp Synthesis by Means of a Genetic Algorithm
Kruiskamp, W. (1995) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac.1995.249986 · Cited by 73
Optimizing dominant time constant in RC circuits
Vandenberghe, L., Boyd, S., & Gamal, A. E. (1998) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.681261 · Cited by 48
Self-citationOptimal wire and transistor sizing for circuits with non-tree topology
Vandenberghe, L., Boyd, S., & Gamal, A. E. (1997) · doi:10.5555/266388.266485 · Cited by 27
Self-citationOptimal wire and transistor sizing for circuits with non-tree topology
Vandenberghe, Boyd, S., & Gamal, E. (1997) · International Conference on Computer Aided Design · doi:10.1109/iccad.1997.643528 · Cited by 27
Self-citation
Cited by
A tutorial on geometric programming
Boyd, S., Kim, S.-J., Vandenberghe, L., & Hassibi, A. (2007) · Optimization and Engineering · doi:10.1007/s11081-007-9001-7 · Cited by 1,195
Self-citationDisciplined Convex Programming
Grant, M., Boyd, S., & Ye, Y. (2006) · Nonconvex Optimization and Its Applications · doi:10.1007/0-387-30528-9_7 · Cited by 1,026
Self-citationCVXGEN: a code generator for embedded convex optimization
Mattingley, J., & Boyd, S. (2012) · Optimization and Engineering · doi:10.1007/s11081-011-9176-9 · Cited by 790
Self-citationGeometric Programming for Communication Systems
Chiang, M. (2005) · now publishers, Inc. eBooks · doi:10.1561/9781933019574 · Cited by 423
Real-Time Convex Optimization in Signal Processing
Mattingley, J., & Boyd, S. (2010) · IEEE Signal Processing Magazine · doi:10.1109/msp.2010.936020 · Cited by 300
Self-citation
Metadata
- Authors
- Hershenson, M. D., Boyd, S. P., & Lee, T. H.
- Venue
- IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Published
- 2001
- Volume
- 20
- Issue
- 1
- Pages
- 1-21
- ISSN
- 0278-0070 (ISSN-L)
- OpenAlex
- W2106476087
- Cited by
- 548
- References
- 43
- FWCI
- 20.65
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.