Need a faster square root calculation? This paper introduces two efficient square root algorithms for integer and floating-point data types, designed for both hardware and software implementation. These algorithms are simpler and faster than standard procedures, with possible application for calculating trigonometric and exponential functions. The article presents square root algorithms for integer and floating point data types, which are simpler and more efficient than standard procedures. Three accompanying MC68000 implementations of the algorithm for 32-bit integer and IEEE single- and double-precision data are available on the CALGO listing. These programs return rounding status in the condition code register. While standard transcendental function generators may be more efficient, efficient square root routines are still important. Three accompanying MC68000 implementations of the algorithm for 32-bit integer and IEEE single- and double-precision data are available on the CALGO listing. These programs return rounding status in the condition code register, and they exhibit the following approximate runtime performance at 8 MHz: 105-134 ps (integer); 180-222 ps (single precision); 558-652 ps (double precision).
Published in ACM Transactions on Mathematical Software, this paper aligns with the journal's focus on presenting and evaluating mathematical algorithms and software implementations. By providing efficient square root algorithms and their implementations, the article contributes to the development of high-quality mathematical software for various applications.