Operations Research
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


OPERATIONS RESEARCH
Vol. 53, No. 6, November-December 2005, pp. 899-932
DOI: 10.1287/opre.1050.0254
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Boyd, S. P.
Right arrow Articles by Horowitz, M. A.
Right arrow Search for Related Content

Digital Circuit Optimization via Geometric Programming

Stephen P. Boyd, Seung-Jean Kim, Dinesh D. Patil, Mark A. Horowitz

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
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

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.

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:


Home page
Operations ResearchHome page
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
Copyright © 2005 by INFORMS.