• DocumentCode
    2460976
  • Title

    Exact rounding of certain elementary functions

  • Author

    Schulte, Michael ; Swartzlander, Earl

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Texas Univ., Austin, TX, USA
  • fYear
    1993
  • fDate
    29 Jun-2 Jul 1993
  • Firstpage
    138
  • Lastpage
    145
  • Abstract
    An algorithm is described which produces exactly rounded results for the functions of reciprocal, square root, 2x, and log 2 x. Hardware designs based on this algorithm are presented for floating point numbers with 16- and 24-b significands. These designs use a polynomial approximation in which coefficients are originally selected based on the Chebyshev series approximation and are then adjusted to ensure exactly rounded results for all inputs. To reduce the number of terms in the approximation, the input interval is divided into subintervals of equal size and different coefficients are used for each subinterval. For floating point numbers with 16-b significands, the exactly rounded value of the function can be computed in 51 ns on a 20-mm2 chip. For floating point numbers with 24-b significands, the functions can be computed in 80 ns on a 98-mm2 chip
  • Keywords
    floating point arithmetic; function evaluation; elementary functions; exact rounding; floating point numbers; polynomial approximation; reciprocal; rounded results; square root; Algorithm design and analysis; Arithmetic; Chebyshev approximation; Hardware; Polynomials; Software algorithms; Software performance;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Arithmetic, 1993. Proceedings., 11th Symposium on
  • Conference_Location
    Windsor, Ont.
  • Print_ISBN
    0-8186-3862-1
  • Type

    conf

  • DOI
    10.1109/ARITH.1993.378099
  • Filename
    378099