## GPCAD: A Tool for CMOS Op-Amp Synthesis (1998)

### Cached

### Download Links

- [www.stanford.edu]
- [andante.eecs.umich.edu]
- [stanford.edu]
- [www.stanford.edu]
- DBLP

### Other Repositories/Bibliography

Citations: | 35 - 13 self |

### BibTeX

@MISC{Hershenson98gpcad:a,

author = {Maria del Mar Hershenson and Stephen P. Boyd and Thomas H. Lee},

title = {GPCAD: A Tool for CMOS Op-Amp Synthesis},

year = {1998}

}

### Years of Citing Articles

### OpenURL

### Abstract

We present a method for optimizing and automating component and transistor sizing for CMOS operational amplifiers. We observe that a wide variety of performance measures can be formulated as posynomial functions of the design variables. As a result, amplifier design problems can be formulated as a geometric program, a special type of convex optimization problem for which very efficient global optimization methods have recently been developed. The synthesis method is therefore fast, and determines the globally optimal design; in particular the final solution is completely independent of the starting point (which can even be infeasible), and infeasible specifications are unambiguously detected. After briefly introducing the method, which is described in more detail in [1], we show how the method can be applied to six common op-amp architectures, and give several example designs. 1 Introduction As the demand for mixed mode integrated circuits increases, the design of analog circuits su...

### Citations

507 | Primal-Dual Interior-Point Methods
- Wright
- 1997
(Show Context)
Citation Context ... optimization are beginning to be widely appreciated, mostly due to the development of extremely powerful interior-point methods for general convex optimization problems in the last five years (e.g., =-=[16,17]-=-). These methods can solve large problems, with thousands of variables and tens of thousands of constraints, very efficiently (e.g., in minutes on a small workstation). Problems involving tens of vari... |

264 |
Interior point polynomial methods in convex programming
- Nesterov, Nemirovsky
- 1994
(Show Context)
Citation Context ... optimization are beginning to be widely appreciated, mostly due to the development of extremely powerful interior-point methods for general convex optimization problems in the last five years (e.g., =-=[16,17]-=-). These methods can solve large problems, with thousands of variables and tens of thousands of constraints, very efficiently (e.g., in minutes on a small workstation). Problems involving tens of vari... |

81 | OASYS: A framework for analog circuit synthesis
- Harjani, Rutenbar, et al.
- 1989
(Show Context)
Citation Context ...stems methods have also been widely used in analog circuit CAD. Examples include genetic algorithms or evolution systems like DARWIN [10] and special heuristics based systems like IDAC [11] and OASYS =-=[12]-=-. These methods have few limitations on the types of problems, specifications, and performance measures that can be considered but they have several disadvantages. They find a locally optimal design (... |

68 | Optimal Design of a CMOS Op-amp via Geometric Programming
- Hershenson, Boyd, et al.
- 1997
(Show Context)
Citation Context ... independent of the starting point (which can even be infeasible), and infeasible specifications are unambiguously detected. After briefly introducing the method, which is described in more detail in =-=[1]-=-, we show how the method can be applied to six common op-amp architectures, and give several example designs. 1 Introduction As the demand for mixed mode integrated circuits increases, the design of a... |

66 |
Introduction to Convex Optimization with Engineering Applications
- Boyd, Vandenberghe
- 2003
(Show Context)
Citation Context ...nimize h0(y) = log f0(e y1 yn ;:::;e ) subject to hi(y) = log fi(e y1 yn ;:::;e ) 0; vi(y) = log gi(e y1 yn ;:::;e )=0: This is the so-called exponential form of the geometric program (1) (see, e.g., =-=[20]-=-). There are several methods for solving geometric programs. One option is to solve the exponential form of the geometric program using a general purpose optimization code such as NPSOL or MINOS. Thes... |

58 | Synthesis of High-Performance Analog Circuits in ASTRX/OBLX
- Ochotta, Rutenbar, et al.
- 1996
(Show Context)
Citation Context ...c. Like classical and knowledge-based methods, SA allows a very wide variety of performance measures and objectives to be handled. Simulated annealing has been used in several tools such as ASTR/OBLX =-=[14]-=- and OPTIMAN [15]. The main disadvantages of SA are that it can be very slow, and in practice it cannot guarantee a global optimal solution. Convex optimization methods In a convex optimization proble... |

53 |
Geometric Programming. Theory and Application
- Duffin, Peterson, et al.
- 1967
(Show Context)
Citation Context ...e that proves that the problem is infeasible. 3 Geometric Programming Geometric programming (GP) is a special type of convex optimization problem. It has been known and used since the late 1960s (see =-=[18]-=-); more recently it has been widely used in transistor and wire sizing for Elmore delay minimization in digital circuits, as in TILOS [19]. As far as we know, it has not been used before in analog amp... |

44 |
OPASYN: A Compiler for CMOS Operational Amplifiers
- Koh, Sequin, et al.
- 1990
(Show Context)
Citation Context ...neral purpose optimization codes NPSOL [3] and MINOS are used in, e.g., [4, 5]. Other CAD methods based on classical optimization methods, and extensions such as a minimax formulation, include OPASYN =-=[6]-=-, OAC [7], and STAIC [8]. These classical methods can be used with complicated circuit models, including full SPICE simulations in each iteration, as in DELIGHT.SPICE [9]. The main disadvantage of cla... |

39 |
An infeasible interior-point algorithm for solving primal and dual geometric programs
- Kortanek, Xu, et al.
- 1996
(Show Context)
Citation Context ...ted primaldual interior-point methods used in linear programming can be extended to GP, resulting in an algorithm with efficiency approaching that of current interior-point linear programming solvers =-=[21]-=-. For use in GPCAD we have implemented, in MATLAB, a very simple primal barrier method, which is described in [1] and [20]. Despite the simplicity of our algorithm and the overhead of an interpreted l... |

37 |
Analog circuit design optimization based on symbolic simulation and simulated annealing
- Gielen, Walscharts, et al.
- 1990
(Show Context)
Citation Context ... and knowledge-based methods, SA allows a very wide variety of performance measures and objectives to be handled. Simulated annealing has been used in several tools such as ASTR/OBLX [14] and OPTIMAN =-=[15]-=-. The main disadvantages of SA are that it can be very slow, and in practice it cannot guarantee a global optimal solution. Convex optimization methods In a convex optimization problem we minimize a c... |

17 |
TILOS: “A Polynomial Programming Approach to Transistor Sizing
- Fishburn, Dunlop
- 1985
(Show Context)
Citation Context ...problem. It has been known and used since the late 1960s (see [18]); more recently it has been widely used in transistor and wire sizing for Elmore delay minimization in digital circuits, as in TILOS =-=[19]-=-. As far as we know, it has not been used before in analog amplifier design. Let x be a vector (x1;:::;xn)of n real, positive variables. A function f is called a posynomial function of x if it has the... |

16 |
STAIC: An interactive framework for synthesizing CMOS and BiCMOS analog circuits
- Harvey, Elmasry, et al.
- 1992
(Show Context)
Citation Context ...on codes NPSOL [3] and MINOS are used in, e.g., [4, 5]. Other CAD methods based on classical optimization methods, and extensions such as a minimax formulation, include OPASYN [6], OAC [7], and STAIC =-=[8]-=-. These classical methods can be used with complicated circuit models, including full SPICE simulations in each iteration, as in DELIGHT.SPICE [9]. The main disadvantage of classical methods is that t... |

15 |
Integer programming based topology selection of cell-level analog circuits
- Maulik, Carley, et al.
- 1995
(Show Context)
Citation Context ...ither during the design process, or during the training process. Global optimization methods Global optimization methods such as branch and bound and simulated annealing have also been used, e.g., in =-=[13]-=-. Branch and bound unambiguously determines the global optimal design but it is extremely slow, with computation growing exponentially with problem size. Simulated annealing (SA) is another very popul... |

10 |
et al. A top-down, constraint-driven design methodology for analog integrated circuits
- Chang
- 1992
(Show Context)
Citation Context ...t descent, sequential quadratic programming and Lagrange multiplier methods, have been widely used in analog circuit CAD. The general purpose optimization codes NPSOL [3] and MINOS are used in, e.g., =-=[4, 5]-=-. Other CAD methods based on classical optimization methods, and extensions such as a minimax formulation, include OPASYN [6], OAC [7], and STAIC [8]. These classical methods can be used with complica... |

10 |
CMOS Opamp synthesis by means of a genetic algorithm
- DARWIN
- 1995
(Show Context)
Citation Context ...ELIGHT.SPICE.Knowledge-based methods Knowledge-based and expert-systems methods have also been widely used in analog circuit CAD. Examples include genetic algorithms or evolution systems like DARWIN =-=[10]-=- and special heuristics based systems like IDAC [11] and OASYS [12]. These methods have few limitations on the types of problems, specifications, and performance measures that can be considered but th... |

6 |
On the Capability of Analysis Techniques
- Tubio, Fernandez, et al.
- 1999
(Show Context)
Citation Context ...performance specifications in a form appropriate for geometric programming. At this point, we have no method for automating this step, although we envision using some type of symbolic analyzer (e.g., =-=[22]-=-) to aid in this process. Of course, this step is done only once for each topology; once the library entry exists, specific design problems involving that topology are solved within a few of seconds, ... |

5 |
Operational amplifier compilation with performance optimization
- Onodera
- 1990
(Show Context)
Citation Context ...pose optimization codes NPSOL [3] and MINOS are used in, e.g., [4, 5]. Other CAD methods based on classical optimization methods, and extensions such as a minimax formulation, include OPASYN [6], OAC =-=[7]-=-, and STAIC [8]. These classical methods can be used with complicated circuit models, including full SPICE simulations in each iteration, as in DELIGHT.SPICE [9]. The main disadvantage of classical me... |

3 |
Degrauwe et al. Towards an analog system design environment
- R
- 1989
(Show Context)
Citation Context ...d and expert-systems methods have also been widely used in analog circuit CAD. Examples include genetic algorithms or evolution systems like DARWIN [10] and special heuristics based systems like IDAC =-=[11]-=- and OASYS [12]. These methods have few limitations on the types of problems, specifications, and performance measures that can be considered but they have several disadvantages. They find a locally o... |

2 |
et al., User’s guide for NPSOL (version 4.0): A Fortran package for nonlinear programming
- Gill, Murray, et al.
- 1992
(Show Context)
Citation Context ...mization methods, such as steepest descent, sequential quadratic programming and Lagrange multiplier methods, have been widely used in analog circuit CAD. The general purpose optimization codes NPSOL =-=[3]-=- and MINOS are used in, e.g., [4, 5]. Other CAD methods based on classical optimization methods, and extensions such as a minimax formulation, include OPASYN [6], OAC [7], and STAIC [8]. These classic... |

1 |
MOS models for geometric programming
- Hershenson, Boyd, et al.
- 1998
(Show Context)
Citation Context ...el submicron devices, we are now developing more sophisticated and accurate models that are still compatible with geometric programming based design. These models, which we call GP2, are described in =-=[2]-=-. Vdd M3 M4 Vout V+ M1 M2 V, CL Ibias Vss M6 M5 Vss Figure 2: Simple OTA op-amp. Vdd M9 M3 M4 V+ M1 M2 V, Ibias M8 M10 M5 M6 Vout CL M7 Vss 5 Op-amp architectures We will apply the method to the six d... |

1 |
Maulik et al.˙ Rapid redesign of analog standard cells using constrained optimization techniques
- C
- 1992
(Show Context)
Citation Context ...t descent, sequential quadratic programming and Lagrange multiplier methods, have been widely used in analog circuit CAD. The general purpose optimization codes NPSOL [3] and MINOS are used in, e.g., =-=[4, 5]-=-. Other CAD methods based on classical optimization methods, and extensions such as a minimax formulation, include OPASYN [6], OAC [7], and STAIC [8]. These classical methods can be used with complica... |

1 |
et al.˙DELIGTH.SPICE: An optimization-based system for the design of integrated circuits
- Nye
- 1988
(Show Context)
Citation Context ...x formulation, include OPASYN [6], OAC [7], and STAIC [8]. These classical methods can be used with complicated circuit models, including full SPICE simulations in each iteration, as in DELIGHT.SPICE =-=[9]-=-. The main disadvantage of classical methods is that they only find locally optimal designs. This means that it is possible that some other set of design parameters, far away from the one found, resul... |