This Article 
 Bibliographic References 
 Add to: 
Reciprocation, Square Root, Inverse Square Root, and Some Elementary Functions Using Small Multipliers
July 2000 (vol. 49 no. 7)
pp. 628-637

Abstract—This paper deals with the computation of reciprocals, square roots, inverse square roots, and some elementary functions using small tables, small multipliers, and, for some functions, a final “large” (almost full-length) multiplication. We propose a method, based on argument reduction and series expansion, that allows fast evaluation of these functions in high precision. The strength of this method is that the same scheme allows the computation of all these functions. We estimate the delay, the size/number of tables, and the size/number of multipliers and compare with other related methods.

[1] M.D. Ercegovac and T. Lang, Division and Square Root—Digit-Recurrence Algorithms and Implementations. Kluwer Academic, 1994.
[2] P.M. Farmwald, “High Bandwidth Evaluation of Elementary Functions,” Proc. Fifth IEEE Symp. Computer Arithmetic, K.S. Trivedi and D.E. Atkins, eds., 1981.
[3] H. Hassler and N. Takagi, "Function Evaluation by Table Look-Up and Addition," Proc. 12th Symp. Computer Arithmetic, pp. 10-16, July 1995.
[4] C. Iordache and D.W. Matula, “On Infinitely Precise Rounding for Division, Square Root, Reciprocal and Square Root Reciprocal,” Proc. 14th IEEE Symp. Computer Arithmetic, I. Koren and P. Kornerup, eds., pp. 233-240, Apr. 1999.
[5] M. Ito, N. Takagi, and S. Yajima, “Efficient Initial Approximation and Fast Converging Methods for Division and Square Root,” Proc. 12th Symp. Computer Arithmetic (ARITH12), pp. 2-9, 1995.
[6] V.K. Jain and L. Lin, “High-Speed Double Precision Computation of Nonlinear Functions,” Proc. 12th Symp. Computer Arithmetic, pp. 107-114, 1995.
[7] V. Lefèvre, J.M. Muller, and A. Tisserand, “Towards Correctly Rounded Transcendentals,” IEEE Trans. Computers, vol. 47, no. 11, pp. 1,235-1,243, Nov. 1998.
[8] J.M. Muller, Elementary Functions. Algorithms and Implementation. Birkhauser, 1997.
[9] S.F. Oberman and M.J. Flynn, “Division Algorithms and Implementations,” IEEE Trans. Computers, vol. 46, no. 8, pp. 833-854, Aug. 1997.
[10] D. DasSarma and D.W. Matula, “Faithful Bipartite ROM Reciprocal Tables,” Proc. 12th Symp. Computer Arithmetic, pp. 17-28, 1995.
[11] M.J. Schulte and J.E. Stine, “Symmetric Bipartite Tables for Accurate Function Approximation” Proc. 13th Symp. Computer Arithmetic (ARITH13), pp. 175-183, 1997.
[12] P.T.P. Tang, “Table-Lookup Algorithms for Elementary Functions and Their Error Analysis,” Proc. 10th Symp. Computer Arithmetic, pp. 232-236, 1991.
[13] W.F. Wong and E. Goto, “Fast Hardware-Based Algorithms for Elementary Function Computations,” IEEE Trans. Computers, vol. 43, no. 3, pp. 278-294, Mar. 1994.
[14] W-F. Wong and E. Goto, “Fast Evaluation of Elementary Functions in Single Precision,” IEEE Trans. Computers, vol. 44, no. 3, pp. 453-457, Mar. 1995.
[15] T. Lang and P. Montuschi, “Very-High Radix Square Root with Prescaling and Rounding and a Combined Division/Square Root Unit,” IEEE Trans. Computers, vol. 48, no. 8, pp. 827-841, Aug. 1999.
[16] E. Antelo, T. Lang, and J.D. Bruguera, “Computation of$\sqrt{x/d}$in a Very High Radix Combined Division/Square-Root Unit with Scaling,” IEEE Trans. Computers, vol. 47, no. 2, pp. 152-161, Feb. 1998.

Index Terms:
Reciprocal, square root, inverse square root, logarithm, exponential, single-/double-precision operations, small multipliers, Taylor series.
Milos D. Ercegovac, Tomás Lang, Jean-Michel Muller, Arnaud Tisserand, "Reciprocation, Square Root, Inverse Square Root, and Some Elementary Functions Using Small Multipliers," IEEE Transactions on Computers, vol. 49, no. 7, pp. 628-637, July 2000, doi:10.1109/12.863031
Usage of this product signifies your acceptance of the Terms of Use.