Radix-4 Reciprocal Square-Root and Its Combination with Division and Square Root

In this work, we present a reciprocal square root algorithm by digit recurrence and selection by a staircase function and the radix-4 implementation. As in similar algorithms for division and square root, the results are obtained correctly rounded in a straightforward manner (in contrast to existing methods to compute the reciprocal square root). Although, apparently, a single selection function can only be used for j /spl ges/ 2 (the selection constants are different for j = 0, j = 1, and j /spl ges/ 2), we show that it is possible to use a single selection function for all iterations. We perform a rough comparison with existing methods and we conclude that our implementation is a low hardware complexity solution with moderate latency, especially for exactly rounded results. We also extend the unit to support division and square root with the same selection function and with slight modifications in the initialization of the reciprocal square root unit.

[1]  Arnaud Tisserand,et al.  Reciprocation, Square Root, Inverse Square Root, and Some Elementary Functions Using Small Multipliers , 2000, IEEE Trans. Computers.

[2]  Michael J. Schulte,et al.  Approximating Elementary Functions with Symmetric Bipartite Tables , 1999, IEEE Trans. Computers.

[3]  Naofumi Takagi.  Generating a power of an operand by a table look-up and a multiplication , 1997, Proceedings 13th IEEE Sympsoium on Computer Arithmetic.

[4]  Tomás Lang,et al.  Correctly rounded reciprocal square-root by digit recurrence and radix-4 implementation , 2001, Proceedings 15th IEEE Symposium on Computer Arithmetic. ARITH-15 2001.

[5]  Ramesh C. Agarwal,et al.  Series approximation methods for divide and square root in the Power3/sup TM/ processor , 1999, Proceedings 14th IEEE Symposium on Computer Arithmetic (Cat. No.99CB36336).

[6]  Weng-Fai Wong,et al.  Fast Evaluation of the Elementary Functions in Single Precision , 1995, IEEE Trans. Computers.

[7]  Debjit Das Sarma,et al.  Faithful interpolation in reciprocal tables , 1997, Proceedings 13th IEEE Sympsoium on Computer Arithmetic.

[8]  Michael J. Schulte,et al.  High-speed inverse square roots , 1999, Proceedings 14th IEEE Symposium on Computer Arithmetic (Cat. No.99CB36336).

[9]  Debjit Das Sarma,et al.  Faithful bipartite ROM reciprocal tables , 1995, Proceedings of the 12th Symposium on Computer Arithmetic.

[10]  James E. Robertson,et al.  A New Class of Digital Division Methods , 1958, IRE Trans. Electron. Comput..

[11]  Javier D. Bruguera,et al.  Computation of sqrt(x/d) in a Very High Radix Combined Division/Square-Root Unit with Scaling , 1998, IEEE Trans. Computers.

[12]  Naofumi Takagi.  A hardware algorithm for computing reciprocal square root , 2001, Proceedings 15th IEEE Symposium on Computer Arithmetic. ARITH-15 2001.

[13]  Tomás Lang,et al.  Radix-4 Square Root Without Initial PLA , 1990, IEEE Trans. Computers.

[14]  Stuart F. Oberman,et al.  Floating point division and square root algorithms and implementation in the AMD-K7/sup TM/ microprocessor , 1999, Proceedings 14th IEEE Symposium on Computer Arithmetic (Cat. No.99CB36336).

[15]  M. Ercegovac,et al.  Division and Square Root: Digit-Recurrence Algorithms and Implementations , 1994 .

[16]  Vijay K. Jain,et al.  High-speed double precision computation of nonlinear functions , 1995, Proceedings of the 12th Symposium on Computer Arithmetic.

[17]  Naofumi Takagi,et al.  Function evaluation by table look-up and addition , 1995, Proceedings of the 12th Symposium on Computer Arithmetic.

[18]  Tomás Lang,et al.  Low-Power Divider , 1999, IEEE Trans. Computers.

[19]  Weng-Fai Wong,et al.  Fast Hardware-Based Algorithms for Elementary Function Computations Using Rectangular Multipliers , 1994, IEEE Trans. Computers.