• DocumentCode
    2454951
  • Title

    Generating function approximations at compile time

  • Author

    Muller, Jean-Michel

  • Author_Institution
    CNRS - Lab. LIP, Univ. Claude Bernard, Lyon
  • fYear
    2006
  • fDate
    Oct. 29 2006-Nov. 1 2006
  • Firstpage
    328
  • Lastpage
    331
  • Abstract
    Usually, the mathematical functions used in a numerical programs are decomposed into elementary functions (such as sine, cosine, exponential, logarithm...), and for each of these functions, we use a program from a library. This may have some drawbacks: first in frequent cases, it is a compound function (e.g. log(l + exp(-x))) that is needed, so that directly building a polynomial or rational approximation for that function (instead of decomposing it) would result in a faster and/or more accurate calculation. Also, at compile-time, we might have some information (e.g., on the range of the input value) that could help to simplify the program. We investigate the possibility of directly building accurate approximations at compile-time.
  • Keywords
    function approximation; compile time; compound function; elementary functions; function approximations; mathematical functions; Algorithm design and analysis; Arithmetic; Availability; Function approximation; Hardware; Humans; Libraries; Minimax techniques; Polynomials; Software algorithms;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Signals, Systems and Computers, 2006. ACSSC '06. Fortieth Asilomar Conference on
  • Conference_Location
    Pacific Grove, CA
  • ISSN
    1058-6393
  • Print_ISBN
    1-4244-0784-2
  • Electronic_ISBN
    1058-6393
  • Type

    conf

  • DOI
    10.1109/ACSSC.2006.354761
  • Filename
    4176571