Digital Circuit Optimization via Geometric Programming
Authors:
- 1 December 2005
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 53 (6) , 899-932
Abstract
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.Keywords
This publication has 136 references indexed in Scilit:
- Low-power design using multiple channel lengths and oxide thicknessesIEEE Design & Test of Computers, 2004
- Design and optimization of multithreshold cmos (mtcmos) circuitsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2003
- RC delay metrics for performance optimizationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2001
- Limitations and challenges of computer-aided design technology for CMOS VLSIProceedings of the IEEE, 2001
- Dynamic threshold pass-transistor logic for improved delay at lower power supply voltagesIEEE Journal of Solid-State Circuits, 1999
- EWA: efficient wiring-sizing algorithm for signal nets and clock netsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1998
- Power conscious CAD tools and methodologies: a perspectiveProceedings of the IEEE, 1995
- Optimal wiresizing under Elmore delay modelIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1995
- An exact solution to the transistor sizing problem for CMOS circuits using convex optimizationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1993
- Alpha-power law MOSFET model and its applications to CMOS inverter delay and other formulasIEEE Journal of Solid-State Circuits, 1990