ACM Home Page
Please provide us with feedback. Feedback
Efficient and accurate gate sizing with piecewise convex delay models
Full text PdfPdf (1.10 MB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 42nd annual Design Automation Conference table of contents
Anaheim, California, USA
SESSION: Electrical optimization for physical synthesis table of contents
Pages: 807 - 812  
Year of Publication: 2005
ISBN:1-59593-058-2
Authors
Hiran Tennakoon  University of Washington, Seattle, WA
Carl Sechen  University of Washington, Seattle, WA
Sponsors
ACM: Association for Computing Machinery
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 32,   Citation Count: 3
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1065579.1065793
What is a DOI?

ABSTRACT

We present an efficient and accurate gate sizing tool that employs a novel piecewise convex delay model, handling both rise and fall delays, for static CMOS gates. The delay model is used in a new version of a gate-sizing tool called Forge, which not only exhibits optimality, but also efficiently produces the area versus delay trade-off curve for a block in one step. Forge includes a realistic delay propagation scheme that combines arrival times and slew-rates. Forge is 6.4X faster than a commercial transistor sizing tool, while achieving better delay targets and uses 28% less transistor area for specific delay targets, on average.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
M. delM. Hershenson, S.P. Boyd, and T.H. Lee, "Optimal design of a CMOS op-amp via geometric programming," IEEE Trans. on Computer-Aided Design, vol. 20, no 1, pp. 1--21, Jan 2001.
2
3
 
4
M.R.C.M. Berkelaar, P.H.W. Buurman, and J. A. G. Jess, "Computing the entire active area/power consumption versus delay tradeoff curve for gate sizing with a piecewise linear simulator," IEEE Trans. on Computer-Aided Design, vol. 15, no. 11, pp. 1424--1434, Nov 1996.
 
5
J. P. Fishburn and A. E. Dunlop, "TILOS: A posynomial programming approach to transistor sizing," IEEE Trans. on Computer-Aided Design, pp. 326--328, Nov 1985.
 
6
W.C. Elmore, "The transient analysis of damped linear networks with particular regard to wideband amplifiers." Journal of Applied Physics, vol. 19, no. 1, pp. 55--63, 1948.
 
7
K. Kasamsetty, M. Ketkar, and S. S. Sapatnekar, "A New Class of Convex Functions for Delay Modeling and their Application to the Transistor Sizing Problem," IEEE Trans. on Computer-Aided, vol. 19, no. 7, pp. 779--788, July 2000.
 
8
 
9
S. S. Sapatnekar, V. B. Rao, P. M. Vaidya, and S. M. Kang, "An exact solution of the transistor sizing problem for CMOS circuits using convex optimization," IEEE Trans. on Computer-Aided Design, vol. 12, pp. 1621--1634, Nov 1993.
 
10
V. Sundararajan, S. S. Sapatnekar, and K. K. Parhi, "Fast and Exact Transistor Sizing Based on Iterative Relaxation," IEEE Trans. on Computer-Aided Design, vol. 21, no. 5, pp. 568--581, May 2002.
11
12
 
13
A. R. Conn, P. K. Coulman, R. A. Harring, G. L. Morril, C. Visweshwariah, and C. W. Wu, "JiffyTune: Circuit optimization using time-domain sensitivities," IEEE Trans. on Computer-Aided Design, vol. 17, no. 12, pp. 1292--1309, Dec 1998.
14
 
15
16
 
17
Jorge Nocedal, and Stephen J. Wright, Numerical Optimization, Springer-Verlag, 1999.
 
18
M. S. Bazaraa, H. D. Sherali, C. M. Shetty, Nonlinear Programming: Theory and Algorithms, Second Edition, John Wiley and Sons, 1993


Collaborative Colleagues:
Hiran Tennakoon: colleagues
Carl Sechen: colleagues