
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Milos D. Ercegovac, Laurent Imbert, David W. Matula, JeanMichel Muller, Guoheng Wei, "Improving Goldschmidt Division, Square Root, and Square Root Reciprocal," IEEE Transactions on Computers, vol. 49, no. 7, pp. 759763, July, 2000.  
BibTex  x  
@article{ 10.1109/12.863046, author = {Milos D. Ercegovac and Laurent Imbert and David W. Matula and JeanMichel Muller and Guoheng Wei}, title = {Improving Goldschmidt Division, Square Root, and Square Root Reciprocal}, journal ={IEEE Transactions on Computers}, volume = {49}, number = {7}, issn = {00189340}, year = {2000}, pages = {759763}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.863046}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Improving Goldschmidt Division, Square Root, and Square Root Reciprocal IS  7 SN  00189340 SP759 EP763 EPD  759763 A1  Milos D. Ercegovac, A1  Laurent Imbert, A1  David W. Matula, A1  JeanMichel Muller, A1  Guoheng Wei, PY  2000 KW  Division KW  square root KW  square root reciprocal KW  convergence division KW  computer arithmetic KW  Goldschmidt iteration. VL  49 JA  IEEE Transactions on Computers ER   
Abstract—The aim of this paper is to accelerate division, square root, and square root reciprocal computations when the Goldschmidt method is used on a pipelined multiplier. This is done by replacing the last iteration by the addition of a correcting term that can be looked up during the early iterations. We describe several variants of the Goldschmidt algorithm, assuming 4cycle pipelined multiplier, and discuss obtained number of cycles and error achieved. Extensions to other than 4cycle multipliers are given. If we call
[1] M.A. CorneaHasegan, R.A. Golliver, and P. Markstein, “Correctness Proofs Outline for NewtonRaphson Based FloatingPoint Divide and Square Root Algorithms,” Proc. 14th IEEE Symp. Computer Arithmetic, I. Koren and P. Kornerup, eds., pp. 86105, Apr. 1999.
[2] D. Das Sarma and D.W. Matula, “Measuring the Accuracy of ROM Reciprocal Tables,” IEEE Trans. Computers, vol. 43, no. 8, Aug. 1994.
[3] D. DasSarma and D.W. Matula, “Faithful Bipartite ROM Reciprocal Tables,” Proc. 12th Symp. Computer Arithmetic, pp. 1728, 1995.
[4] M.D. Ercegovac and T. Lang, Division and Square Root—DigitRecurrence Algorithms and Implementations. Kluwer Academic, 1994.
[5] M.J. Flynn, “On Division by Functional Iteration,” IEEE Trans. Computers, vol. 19, no. 8, pp. 702706, Aug. 1970. Reprinted in Computer Arithmetic, E.E. Swartzlander, vol. 1. Los Alamitos, Calif.: IEEE CS Press, 1990.
[6] R.E. Goldschmidt, “Applications of Division by Convergence,” MSc dissertation, Massachusetts Inst. of Tech nology, June 1964.
[7] S. Oberman and M.J. Flynn, “Implementing Division and Other FloatingPoint Operations: A System Perspective,” Scientific Computing and Validated Numerics, Alefeld, Fromer, and Lang, eds., pp. 1824, Akademie Verlag, 1996.
[8] ANSI/IEEE Std. 7541985, Binary FloatingPoint Arithmetic, IEEE Press, Piscataway, N.J., 1985 (also called ISO/IEC 559).
[9] 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. 233240, Apr. 1999.
[10] W. Kahan, “Square Root without Division,” pdf file accessible electronically,http://www.cs.berkeley.edu/~wkahan/ieee754status reciprt.pdf, 1999.
[11] C.V. Ramamoorthy, J.R. Goodman, and K.H. Kim, “Some Properties of Iterative SquareRooting Methods Using HighSpeed Multiplication,” IEEE Trans. Computers, vol. 21, pp. 837847, 1972.
[12] P.W. Markstein, “Computation of Elementary Functions on the IBM RISC System/6000 Processor,” IBM J. Research and Development, vol. 34, no. 1, pp. 111119, Jan. 1990.
[13] S.F. Oberman, “Floating Point Division and Square Root Algorithms and Implementation in the AMDK7 Microprocessor,” Proc. 14th Symp. Computer Arithmetic (ARITH14), pp. 106115, Apr. 1999.
[14] M. Parks, “NumberTheoretic Test Generation for Directed Roundings,” Proc. 14th IEEE Symp. Computer Arithmetic, I. Koren and P. Kornerup, eds., pp. 241248, Apr. 1999.
[15] M.J. Schulte and K.E. Wires, “HighSpeed Inverse Square Roots,” Proc. 14th IEEE Symp. Computer Arithmetic, I. Koren and P. Kornerup, eds., pp. 124131, Apr. 1999.