An efficient algorithm for library-based cell-type selection in high-performance low-power designs
Authors:
Open Access
- 5 November 2012
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 226-232
Abstract
No abstract availableFunding Information
- Division of Computing and Communication Foundations (CCF-0811270CCF-1115550)
This publication has 20 references indexed in Scilit:
- The ISPD-2012 discrete cell sizing contest and benchmark suite2012
- Efficient and accurate gate sizing with piecewise convex delay models2005
- Fast and effective gate-sizing with multiple-Vt assignment using generalized Lagrangian Relaxation2005
- Linear programming for sizing, Vth and Vdd assignment2005
- Solving the Convex Cost Integer Dual Network Flow ProblemManagement Science, 2003
- Fast and exact transistor sizing based on iterative relaxationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2002
- Fast and exact simultaneous gate and wire sizing by Lagrangian relaxationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1999
- Timing and area optimization for standard-cell VLSI circuit designIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1995
- Strongly NP-hard discrete gate-sizing problemsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1994
- 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