ACM Home Page
Please provide us with feedback. Feedback
Robust gate sizing by geometric programming
Full text PdfPdf (531 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 42nd annual Design Automation Conference table of contents
Anaheim, California, USA
SESSION: Statistical optimization and manufacturability table of contents
Pages: 315 - 320  
Year of Publication: 2005
ISBN:1-59593-058-2
Authors
Jaskirat Singh  University of Minnesota, Minneapolis, MN
Vidyasagar Nookala  University of Minnesota, Minneapolis, MN
Zhi-Quan Luo  University of Minnesota, Minneapolis, MN
Sachin Sapatnekar  University of Minnesota, Minneapolis, MN
Sponsors
ACM: Association for Computing Machinery
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 43,   Citation Count: 27
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.1065662
What is a DOI?

ABSTRACT

We present an efficient optimization scheme for gate sizing in the presence of process variations. Using a posynomial delay model, the delay constraints are modified to incorporate uncertainty in the transistor widths and effective channel lengths due to the process variations. An uncertainty ellipsoid method is used to model the random parameter variations. Spatial correlations of intra-die width and channel length variations are incorporated in the optimization procedure. The resulting optimization problem is relaxed to be a Geometric Program and is efficiently solved using convex optimization tools. The effectiveness of our robust gate sizing scheme is demonstrated by applying the optimization on the ISCAS '85 benchmark circuits and testing the optimized circuits by performing Monte Carlo simulations to model the process variations. By varying the size of the uncertainty ellipsoids, a trade-off between area and robustness is explored. Experimental results show that the timing yield of the robustly optimized circuits improves manifold over the traditional deterministically sized circuits. As compared to the worst-case design, the robust gate sizing solution having the same area, has fewer timing violations.


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
J. Fishburn and A. Dunlop, "TILOS: A Posynomial Programming Approach to Transistor Sizing," in Proc. IEEE/ACM ICCAD, pp. 326--328, 1985.
 
2
S. Sapatnekar, V. B. Rao, P. M. Vaidya, and S. M. Kang, "An Exact Solution to the Transistor Sizing Problem for CMOS Circuits Using Convex Optimization," in IEEE Trans. on CAD, vol. 12, pp. 1621--1634, Nov 1993.
 
3
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," in IEEE Trans. on CAD, vol. 19, pp. 779--788, Jul 1998.
4
5
6
7
 
8
 
9
 
10
K. L. Hsiung, S. J. Kim and S. Boyd, "Robust Geometric Programming via Piecewise Linear Approximation," 2003. Submitted to Mathematical Programming, available at http://www.stanford.edu/~boyd/rgp.html.
 
11
H. L. A-Malek and A.-K. S. O. Hassan, "The Ellipsoidal Technique for Design centering and Region Approximation," in IEEE Trans. on CAD, vol. 10, pp. 1006--1014, Aug 1991.
 
12
S. Sapatnekar, P. M. Vaidya, and S. M. Kang, "Convexity-based Algorithms for Design Centering," in IEEE Trans. on CAD, vol. 13, pp. 1536--1549, Dec 1994.
 
13
 
14
 
15
S. Nassif, "Delay Variability: Sources, Impact and Trends," in Proc. ISSCC, pp. 368--369, 2000.
 
16
Available at http://www.mosek.com.
 
17
"TSMC: 180nm Test Data." Available at http://www.mosis.org/Technical/Testdata/tsmc-018-prm.html.
 
18
A. Caldwell, A. B. Kahng and I. Markov, "Capo: a largescale fixed-die placer." available at http://vlsicad.ucsd.edu/GSRC/bookshelf/Slots/Placement.

CITED BY  27

Collaborative Colleagues:
Jaskirat Singh: colleagues
Vidyasagar Nookala: colleagues
Zhi-Quan Luo: colleagues
Sachin Sapatnekar: colleagues