Lp Based Cell Selection With Constraints Of Timing, Area, And Power Consumption
- 24 August 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636757,p. 378-381
- https://doi.org/10.1109/iccad.1994.629822
Abstract
This paper presents a new LP based optimal cell selection method. Optimal cell selection is a useful tool for final tuning of LSI designs. It replaces drivabilities of cells, adjusting timing, area, and power constraints. Using the latest and earliest arrival times, it can handle both setup and hold time constraints. We also make an efficient initial basis, which speeds up a simplex LP solver by 5 times without any relaxations nor approximations. From experimental results, it reduces the clock cycle of a manual designed 13k-transistor chip by 17% without any increase of area.Keywords
This publication has 3 references indexed in Scilit:
- Minimum padding to satisfy short path constraintsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A graph-based simplex algorithm for minimizing the layout size and the delay on timing critical pathsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1993
- MIS: A Multiple-Level Logic Optimization SystemIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987