메뉴 건너뛰기




Volumn 31, Issue 10, 2012, Pages 1558-1571

Algorithms for gate sizing and device parameter selection for high-performance designs

Author keywords

Circuit optimization; dynamic programming; gate sizing; Lagrangian Relaxation

Indexed keywords

CIRCUIT OPTIMIZATION; DEVICE PARAMETERS; DISCRETE OPTIMIZATION PROBLEMS; GATE SIZING; GRAPH MODEL; GRAPH PROBLEMS; HIGH-PERFORMANCE CIRCUITS; HIGH-PERFORMANCE DESIGN; HIGH-PERFORMANCE MICROPROCESSORS; INDUSTRIAL OPTIMIZATION; LAGRANGIAN; LAGRANGIAN RELAXATION; LEAKAGE POWER REDUCTION; LIBRARY DATA; LOW POWER; PRACTICAL PROBLEMS; SIGN-OFF; STATE OF THE ART; TIMING ANALYSIS;

EID: 84866598027     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCAD.2012.2196279     Document Type: Article
Times cited : (36)

References (27)
  • 1
    • 34547176412 scopus 로고    scopus 로고
    • A multi-port current source model for multiple-input switching effects in CMOS library cells
    • DOI 10.1145/1146909.1146974, 2006 43rd ACM/IEEE Design Automation Conference, DAC'06
    • C. S. Amin, C. Kashyap, N. Menezes, K. Killpack, and E. Chiprout, "A multi-port current source model for multiple-input switching effects in CMOS library cells," in Proc. DAC, 2006, pp. 247-252. (Pubitemid 47113901)
    • (2006) Proceedings - Design Automation Conference , pp. 247-252
    • Amin, C.1    Kashyap, C.2    Menezes, N.3    Killpack, K.4    Chiprout, E.5
  • 2
    • 84962312902 scopus 로고
    • Gate sizing in MOS digital circuits with linear programming
    • M. R. C. M. Berkelaar and J. A. G. Jess, "Gate sizing in MOS digital circuits with linear programming," in Proc. DATE, 1990, pp. 217-221.
    • (1990) Proc. DATE , pp. 217-221
    • Berkelaar, M.R.C.M.1    Jess, J.A.G.2
  • 3
    • 0025531765 scopus 로고
    • Algorithms for library-specific sizing of combinational logic
    • P. K. Chan, "Algorithms for library-specific sizing of combinational logic," in Proc. DAC, 1990, pp. 353-356.
    • (1990) Proc. DAC , pp. 353-356
    • Chan, P.K.1
  • 4
    • 0032685389 scopus 로고    scopus 로고
    • Fast and exact simultaneous gate and wire sizing by Lagrangian relaxation
    • Jul.
    • 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 Des., vol. 18, no. 7, pp. 1014-1025, Jul. 1999.
    • (1999) IEEE Trans. Comput.- Aided Des. , vol.18 , Issue.7 , pp. 1014-1025
    • Chen, C.P.1    Chu, C.C.-N.2    Wong, D.F.3
  • 6
    • 84861419836 scopus 로고    scopus 로고
    • Fast and effective gate sizing with multiple-Vt assignment using generalized Lagrangian relaxation
    • 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. ASPDAC, 2005, pp. 381-386.
    • (2005) Proc. ASPDAC , pp. 381-386
    • Chou, H.1    Wang, Y.-H.2    Chen, C.C.-P.3
  • 9
    • 0022031091 scopus 로고
    • An applications oriented guide to Lagrangian relaxation
    • M. L. Fisher, "An applications oriented guide to Lagrangian relaxation," Interfaces, vol. 15, no. 2, pp. 10-21, 1985.
    • (1985) Interfaces , vol.15 , Issue.2 , pp. 10-21
    • Fisher, M.L.1
  • 10
    • 70350070734 scopus 로고    scopus 로고
    • Gate sizing for large cell-based designs
    • S. Held, "Gate sizing for large cell-based designs," in Proc. DATE, 2009, pp. 827-832.
    • (2009) Proc. DATE , pp. 827-832
    • Held, S.1
  • 11
    • 77955191978 scopus 로고    scopus 로고
    • Gate sizing for cell-library-based designs
    • Jun.
    • S. Hu, M. Ketkar, and J. Hu, "Gate sizing for cell-library-based designs," IEEE Trans. Comput.-Aided Des., vol. 28, no. 6, pp. 818-825, Jun. 2009.
    • (2009) IEEE Trans. Comput.-Aided Des. , vol.28 , Issue.6 , pp. 818-825
    • Hu, S.1    Ketkar, M.2    Hu, J.3
  • 12
    • 79955073967 scopus 로고    scopus 로고
    • Lagrangian relaxation for gate implementation selection
    • Y.-L. Huang, J. Hu, and W. Shi, "Lagrangian relaxation for gate implementation selection," in Proc. ISPD, 2011, pp. 167-174.
    • (2011) Proc. ISPD , pp. 167-174
    • Huang, Y.-L.1    Hu, J.2    Shi, W.3
  • 13
    • 78650755007 scopus 로고    scopus 로고
    • Incremental gate sizing for late process changes
    • J. Lee and P. Gupta, "Incremental gate sizing for late process changes," in Proc. ICCD, 2010, pp. 215-221.
    • (2010) Proc. ICCD , pp. 215-221
    • Lee, J.1    Gupta, P.2
  • 14
    • 0027884440 scopus 로고
    • Strongly NP-hard discrete gate sizing problems
    • W.-N. Li, "Strongly NP-hard discrete gate sizing problems," in Proc. ICCD, 1993, pp. 468-471.
    • (1993) Proc. ICCD , pp. 468-471
    • Li, W.-N.1
  • 15
    • 46149102946 scopus 로고    scopus 로고
    • A revisit to floorplan optimization by Lagrangian relaxation
    • Nov.
    • C. Ling, H. Zhou, and C. Chu, "A revisit to floorplan optimization by Lagrangian relaxation," in Proc. ICCAD, Nov. 2006, pp. 164-171.
    • (2006) Proc. ICCAD , pp. 164-171
    • Ling, C.1    Zhou, H.2    Chu, C.3
  • 16
    • 70349085774 scopus 로고    scopus 로고
    • A new algorithm for simultaneous gate sizing and threshold voltage assignment
    • Y. Liu and J. Hu, "A new algorithm for simultaneous gate sizing and threshold voltage assignment," in Proc. ISPD, 2009, pp. 27-34.
    • (2009) Proc. ISPD , pp. 27-34
    • Liu, Y.1    Hu, J.2
  • 18
    • 84862921936 scopus 로고    scopus 로고
    • Gate sizing and device technology selection algorithms for high-performance industrial designs
    • Nov.
    • M. M. Ozdal, S. Burns, and J. Hu, "Gate sizing and device technology selection algorithms for high-performance industrial designs," in Proc. ICCAD, Nov. 2011, pp. 724-731.
    • (2011) Proc. ICCAD , pp. 724-731
    • Ozdal, M.M.1    Burns, S.2    Hu, J.3
  • 19
    • 33845635280 scopus 로고    scopus 로고
    • A length-matching routing algorithm for high-performance printed circuit boards
    • Dec.
    • M. M. Ozdal and M. D. F. Wong, "A length-matching routing algorithm for high-performance printed circuit boards," IEEE Trans. Comput.- Aided Des. Integr. Circuits Syst., vol. 25, no. 12, pp. 2784-2794, Dec. 2006.
    • (2006) IEEE Trans. Comput.- Aided Des. Integr. Circuits Syst. , vol.25 , Issue.12 , pp. 2784-2794
    • Ozdal, M.M.1    Wong, M.D.F.2
  • 20
    • 84855787907 scopus 로고    scopus 로고
    • Power reduction via near optimal library-based cell-size selection
    • M. Rahman, H. Tennakoon, and C. Sechen, "Power reduction via near optimal library-based cell-size selection," in Proc. DATE, 2011, pp. 1-4.
    • (2011) Proc. DATE , pp. 1-4
    • Rahman, M.1    Tennakoon, H.2    Sechen, C.3
  • 23
    • 0027701389 scopus 로고
    • An exact solution to the transistor sizing problem for CMOS circuits using convex programming
    • Nov.
    • 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 programming," IEEE Trans. Comput.-Aided Des., vol. 12, no. 11, pp. 1621-1634, Nov. 1993.
    • (1993) IEEE Trans. Comput.-Aided Des. , vol.12 , Issue.11 , pp. 1621-1634
    • Sapatnekar, S.S.1    Rao, V.B.2    Vaidya, P.M.3    Kang, S.-M.4
  • 24
    • 4444327756 scopus 로고    scopus 로고
    • Power minimization using simultaneous gate sizing, dual-Vdd and dual-Vth assignment
    • A. Srivastava, D. Sylvester, and D. Blaauw, "Power minimization using simultaneous gate sizing, dual-Vdd and dual-Vth assignment," in Proc. DAC, 2004, pp. 783-787.
    • (2004) Proc. DAC , pp. 783-787
    • Srivastava, A.1    Sylvester, D.2    Blaauw, D.3
  • 25
    • 0036911571 scopus 로고    scopus 로고
    • Gate sizing using lagrangian relaxation combined with a fast gradient-based pre-processing step
    • H. Tennakoon and C. Sechen, "Gate sizing using lagrangian relaxation combined with a fast gradient-based pre-processing step," in Proc. ICCAD, 2002, pp. 395-402.
    • (2002) Proc. ICCAD , pp. 395-402
    • Tennakoon, H.1    Sechen, C.2
  • 26
    • 67650917100 scopus 로고    scopus 로고
    • Gate sizing by Lagrangian relaxation revisited
    • Jul.
    • J. Wang, D. Das, and H. Zhou, "Gate sizing by Lagrangian relaxation revisited," IEEE Trans. Comput.-Aided Des., vol. 28, no. 7, pp. 1071-1084, Jul. 2009.
    • (2009) IEEE Trans. Comput.-Aided Des. , vol.28 , Issue.7 , pp. 1071-1084
    • Wang, J.1    Das, D.2    Zhou, H.3
  • 27
    • 0033715439 scopus 로고    scopus 로고
    • Power minimization by simultaneous dual-Vth assignment and gate sizing
    • L. Wei, K. Roy, and C.-K. Koh, "Power minimization by simultaneous dual-Vth assignment and gate sizing," in Proc. CICC, 2000, pp. 413-416.
    • (2000) Proc. CICC , pp. 413-416
    • Wei, L.1    Roy, K.2    Koh, C.-K.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.