• DocumentCode
    3338818
  • Title

    Efficient generation of timing and power polynomial models from lookup tables for SoC designs

  • Author

    Wang, Gaofeng ; Gopisetty, Runip

  • Author_Institution
    Synopsys Inc., Mountain View, CA, USA
  • fYear
    1999
  • fDate
    1999
  • Firstpage
    216
  • Lastpage
    220
  • Abstract
    A new scheme is presented for generating optimal timing and power models, which can speed up timing and power analyses with full accuracy in system-on-chip (SoC) designs. In this scheme, the nonlinear multidimensional timing and power lookup tables in semiconductor libraries are transformed into optimized (piecewise) polynomial equations in an efficient and accurate manner. The transform problem is mathematically defined as a least square problem, which is efficiently solved by a set of robust numerical algorithms. These optimized polynomial equations are then represented using the delay and power calculation language (DPCL), which can be complied into object code and used by various EDA tools
  • Keywords
    circuit CAD; circuit analysis computing; least squares approximations; logic CAD; microprocessor chips; polynomials; table lookup; timing; EDA tools; SOC designs; generation; least square problem; lookup tables; nonlinear multidimensional lookup tables; optimized polynomial equations; piecewise polynomial equations; power polynomial models; robust numerical algorithms; semiconductor libraries; system-on-chip designs; timing polynomial models; Libraries; Multidimensional systems; Nonlinear equations; Polynomials; Power generation; Power system modeling; System-on-a-chip; Table lookup; Timing; Transforms;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    ASIC/SOC Conference, 1999. Proceedings. Twelfth Annual IEEE International
  • Conference_Location
    Washington, DC
  • Print_ISBN
    0-7803-5632-2
  • Type

    conf

  • DOI
    10.1109/ASIC.1999.806507
  • Filename
    806507