|
|
||||||||
Department of Electrical Engineering, Stanford University, Stanford, California 94305-9510
This paper concerns a method for digital circuit optimization based on formulating the problem as a geometric program (GP) or generalized geometric program (GGP), which can be transformed to a convex optimization problem and then very efficiently solved. We start with a basic gate scaling problem, with delay modeled as a simple resistor-capacitor (RC) time constant, and then add various layers of complexity and modeling accuracy, such as accounting for differing signal fall and rise times, and the effects of signal transition times. We then consider more complex formulations such as robust design over corners, multimode design, statistical design, and problems in which threshold and power supply voltage are also variables to be chosen. Finally, we look at the detailed design of gates and interconnect wires, again using a formulation that is compatible with GP or GGP.
Department of Electrical Engineering, Stanford University, Stanford, California 94305-9510
Department of Electrical Engineering, Stanford University, Stanford, California 94305-9510
Department of Electrical Engineering, Stanford University, Stanford, California 94305-9510
boyd{at}stanford.edu
sjkim{at}stanford.edu
ddpatil{at}stanford.edu
horowitz{at}stanford.edu
Subject classifications: programming: geometric; engineering: computer-aided design; digital circuit optimization.
History: Received January 2004;
revision received May 2005;
accepted May 2005.
This article has been cited by other articles:
![]() |
H.-L. Li and H.-C. Lu Global Optimization for Generalized Geometric Programs with Mixed Free-Sign Variables Operations Research, May 1, 2009; 57(3): 701 - 713. [Abstract] [PDF] |
||||
| HOME | HELP | FEEDBACK | SUBSCRIPTIONS | ARCHIVE | SEARCH | TABLE OF CONTENTS |