This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Square Rooting Algorithms for Integer and Floating-Point Numbers
August 1990 (vol. 39 no. 8)
pp. 1025-1029

An algorithm for evaluating the square root of integers and real numbers is developed. The procedure consists of two parts: one to obtain a close estimate of the square root and the other to modify the initial value, iteratively, until a precise root is evaluated. The major effort in this development has been concentrated on two objectives: high speed and no division operation other than division by 2. The first objective is achieved through a simple two-step procedure for getting the first estimate, and then modifying it by employing a fast converging iteration technique. The second objective is also fulfilled through applying bit-shift operation rather than division operation. The algorithm is simulated for both integer and real numbers, and the results are compared to two methods being widely used. The results (tabulated) show considerable improvement in speed compared to these other two methods.

[1] G. M. Cioffi and T. Kailath, "Fast recursive least-squares transversal filters for adaptive filtering,"IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-32, no. 2, Apr. 1984.
[2] G. R. L. Sohie and K. L. Kloker, "A digital signal processor with IEEE floating-point arithmetic,"IEEE Micro, vol. 8, no. 6, pp. 49-67, 1989.
[3] J. H. Zurawski and J. B. Gosling, "Design of a high-speed square root multiply and divide unit,"IEEE Trans. Comput., vol. C-36, pp. 13-23, Jan. 1987.
[4] V. G. Oklobdzija and M. D. Ercegovac, "An on-line square root algorithm,"IEEE Trans. Comput., vol. C-31, no. 1, pp. 70-75, Jan. 1982.
[5] J. Prado and R. Alcantara, "A fast square-rooting algorithm using a digital signal processor,"Proc. IEEE, vol. 75, no. 2, pp. 262-264, Feb. 1987.
[6] J. J. F. Cavanagh,Digital Computer Arithmetic Design and Implementation. New York: McGraw-Hill, 1984, pp. 117-122.
[7] N. R. Scott,Computer Number Systems&Arithmetic. Englewood Cliffs, NJ: Prentice-Hall, 1985, ch. 5.
[8] Y. Jaluria,Computer Methods for Engineering. Boston, MA: Allyn and Bacon, 1988, ch. 4.
[9] "IEEE Standard for Binary Floating-Point Arithmetic," IEEE Standard 754, IEEE Computer Society, 1985.

Index Terms:
square rooting algorithms; integer numbers; initial value modification; floating-point numbers; real numbers; close estimate; precise root; division by 2; fast converging iteration; bit-shift operation; digital arithmetic; iterative methods; number theory.
Citation:
R. Hashemian, "Square Rooting Algorithms for Integer and Floating-Point Numbers," IEEE Transactions on Computers, vol. 39, no. 8, pp. 1025-1029, Aug. 1990, doi:10.1109/12.57041
Usage of this product signifies your acceptance of the Terms of Use.