Numerically convex forms and their application in gate sizing

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 26, Issue 9, 2007, Pages 1637-1647

  Roy, Sanghamitra ^b   Chen, Weijen ^c   Chen, Charlie Chung Ping ^a,d   Hu, Yu Hen ^a,b  

^a IEEE

^b University of Wisconsin Madison   (United States)

^c Afa Technologies Inc   (Taiwan)

^d NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Convex optimization; Gate sizing; Semidefinite programming

Indexed keywords

ERROR ANALYSIS; GLOBAL OPTIMIZATION; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; PERTURBATION TECHNIQUES; PROBLEM SOLVING; TABLE LOOKUP;

CONVEX OPTIMIZATION; GATE SIZING; POSYNOMIALS; SEMIDEFINITE PROGRAMMING;

LOGIC GATES;

EID: 34548272185     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCAD.2007.895793     Document Type: Article

References (18)

1. V. B. Rao, T. N. Trick, and I. N. Hajj, "A table-driven delay-operator approach to timing simulation of MOS VLSI circuits," in Proc. Int. Conf. Comput. Des., 1983, pp. 445-448.
2. 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. Comput.-Aided Design Integ. Circuits Syst., vol. 19, no. 7, pp. 779-788, Jul. 2000.
3. S. J. Benson and Y. Ye, "DSDP5 user guide-The dual-scaling algorithm for semidefinite programming," Argonne Nat. Labs, Argonne, IL, Tech. Rep. ANL/MCS-TM-255, Feb. 16, 2005.
4. C. Lawrence, J. L. Zhou, and A. L. Tits, "User's guide for CFSQP version. 2.5: A C code for solving (Large Scale) constrained nonlinear (Minimax) optimization problems, generating iterates satisfying all inequality constraints," Univ. Maryland, College Park, MD, Tech. Rep. TR-94-16rl, Apr. 1997.
5. J. Fishburn and A. Dunlop, "TILOS: A posynomial programming approach to transistor sizing," in. Proc. IEEE Int. Conf. Comput.-Aided Des., 1985, pp. 326-328.
6. S. 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," IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 12, no. 11, pp. 1621-1634, Nov. 1993.
7. H. Tennakoon. and C. Sechen, "Gate sizing using Lagrangian relaxation, combined with a fast gradient-based pre-processing step," in Proc. Int. Conf. Comput.-Aided Des., 2002, pp. 395-402.
8. M. Vujkovic and C. Sechen, "Optimized power-delay curve generation for standard cell ICs," in Proc. Int. Conf. Comput.-Aided Des., 2002, pp. 387-394.
9. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, U.K.: Cambridge Univ. Press, 2003.
10. J. M. Shyu, A. L. Sangiovanni, J. Fishburn, and A. Dunlop, "Optimization-based transistor sizing," IEEE J. Solid-State Circuits, vol. 23, no. 2, pp. 400-409, Apr. 1988.
11. N. P. Jouppi, "Timing analysis and performance improvement of MOS VLSI design," IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. CAD-6, no. 4, pp. 650-665, Jul. 1987.
12. S. Z. Selim, and M. A. Ismail, "K-means-type algorithms: A generalized convergence theorem and characterization of local optimality," IEEE Trans. Pattern Anal Mach, Intell., vol. PAMI-61, no. 1, pp. 81-87, Jan. 1984.
13. C. C. P. Chen, C C N. Chu, and D. F Wong, "Fast and exact simultaneous gate and wire sizing by Lagrangian relaxation," IEEE Trans. Comput.Aided Design Integr. Circuits Syst., vol. 18, no. 7, pp. 1014-1025, Jul. 1999.
14. L. Vandenberghe and S. Boyd, "Applications of semidefinite programming,"Appl. Numer. Math, vol. 29, no. 3, pp. 283-299, Mar. 1999.
15. S. Roy, W. Chen, and C. C. P. Chen, "ConvexFit: An optimal minimumerror convex fitting and smoothing algorithm with application to gate sizing," in Proc. Int. Conf. Comput.-Aided Des., 2005, pp. 196-203.
16. H. Chou, Y. H. Wang, and C C P. Chen, "Fast and effective gate-sizing with multiple-Vt assignment using generalized Lagrangian relaxation," in Proc. Asia and South Pacific Des. Autom. Conf, 2005, pp. 381-386.
17. J. Nocedal and S. J. Wright, Numerical Optimization. New York: Springer-Verlag, 2000.
18. S. Boyd, S. J. Kim, L. Vandenberghe, and A. Hassibi, A Tutorial on Geometric Programming, 2006. [Online]. Available: http://www.stanford.edu/ boyd/research.html#papers