메뉴 건너뛰기




Volumn 2005, Issue , 2005, Pages 196-203

ConvexFit: An optimal minimum-error convex fitting and smoothing algorithm with application to gate-sizing

Author keywords

[No Author keywords available]

Indexed keywords

CONVEX OPTIMIZATION; CONVEXITY; GATE SIZING; INDUSTRIAL CELL LIBRARIES; POSYNOMIAL FITTING ALGORITHMS;

EID: 33751423598     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCAD.2005.1560063     Document Type: Conference Paper
Times cited : (16)

References (16)
  • 2
    • 33751409982 scopus 로고    scopus 로고
    • A new class of convex functions for delay modeling and their application to the transistor sizing problem
    • Apr.
    • Kishore Kasamsetty, Mahesh Ketkar and Sachin S. Sapatnekar, "A New Class of Convex Functions for Delay Modeling and their Application to the Transistor Sizing Problem", in IEEE Journal of Solid-State Circuits, Vol. 37, pp. 521-525, Apr.2002.
    • (2002) IEEE Journal of Solid-State Circuits , vol.37 , pp. 521-525
    • Kasamsetty, K.1    Ketkar, M.2    Sapatnekar, S.S.3
  • 6
    • 0027701389 scopus 로고
    • An exact solution to the transistor sizing problem for cmos circuits using convex optimization
    • 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", in IEEE Transaction on Computer-Aided Designed. 12, pp.1621-1634, 1993.
    • (1993) IEEE Transaction on Computer-aided Designed , vol.12 , pp. 1621-1634
    • Sapatnekar, S.S.1    Rao, V.B.2    Vaidya, P.M.3    Kang, S.M.4
  • 7
    • 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 International Conference on Computer-Aided Design, pp.395-402, 2002.
    • (2002) International Conference on Computer-aided Design , pp. 395-402
    • Tennakoon, H.1    Sechen, C.2
  • 9
    • 0004055894 scopus 로고    scopus 로고
    • Cambridge University Press, J.-M. Shyu, A. L. Sangiovanni-Vincentelli
    • S. Boyd and L. Vandenberghe, "Convex Optimization", Cambridge University Press, 2003. J.-M. Shyu, A. L. Sangiovanni-Vincentelli,
    • (2003) Convex Optimization
    • Boyd, S.1    Vandenberghe, L.2
  • 11
    • 0023386645 scopus 로고
    • Timing analysis and performance improvement of MOS VLSI design
    • July
    • N.P Jouppi," Timing analysis and performance improvement of MOS VLSI design," in IEEE Transactions on Computer-Aided Design,vol. CAD6, pp.650-665, July 1987
    • (1987) IEEE Transactions on Computer-Aided Design , vol.CAD6 , pp. 650-665
    • Jouppi, N.P.1
  • 12
    • 0021202650 scopus 로고
    • K-means-type algorithms: A generalized convergence theorem and characterization of local optimality
    • January
    • S.Z Selim and M.A Ismail,"K-Means-Type algorithms: a generalized convergence theorem and characterization of local optimality," in IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 6, pp.81-87, January 1984.
    • (1984) IEEE Transactions on Pattern Analysis and Machine Intelligence , vol.6 , pp. 81-87
    • Selim, S.Z.1    Ismail, M.A.2


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