Fast IEEE double precision reciprocals and square roots

Abstract

Abstract A method and apparatus implement reciprocal and square root calculations using Chebyshev polynomial approximation by scaling the mantissas of IEEE floating point numbers based on splitting them into intervals, thereby allowing Chebyshev polynomials of few terms to approximate each interval and resulting in high performance. A reciprocal or square root operation is implemented in a floating point unit (FPU) of a computer having a pipelined multiply accumulate function using a Chebyshev polynomial approximation. A plurality of Chebyshev coefficients are stored in read only storage. Mantissas m of floating point numbers are scaled based on splitting the mantissas into 2 n intervals i as: m'=2N×m-(2N+2i+1), where m' is the scaled mantissa and N is a power of 2. Using a predetermined number of high bits of the scaled mantissa, a set of stored coefficients are read from read only storage to compute the polynomial. The actual computation of the reciprocal or square root is performed by a plurality of multiply accumulates in the piplined function of the FPU to compute the polynomial approximation of the function f(m), which approximation differs from a correct answer by no more than 1 bit: f(m)=c.sub.0 +m'×(c.sub.1 +m'×(c.sub.2 +m'×(c.sub.3 + . . . +m'×c n ))), where c 0 . . . c n are the set of coefficients selected by the high bits of the mantissa. In addition, the method and apparatus distinguish approximations potentially requiring one bit error correction from those known to be correct.

Inventors

• 👤 Lawrence M. Ammann

Bibliographic Details