Algorithm 650
Kenneth C. Johnson · ACM Transactions on Mathematical Software · 1987
Two square root algorithms (for integer and floating point data types) are presented, which are simpler and more efficient than standard procedures. These could be effectively used as the basis of hardware-based square root generators as well as for software implementations. One possible appli- cation for an efficient square root routine would be in calculating trigonometric and exponential functions. (This application may be primarily of academic interest, however, since standard tran- scendental function generators would generally be more efficient.) 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).