Issue No. 08 - August (1990 vol. 39)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.57040
<p>A systematic derivation of a radix-4 square-root algorithm using redundant residual and result is presented. Unlike other similar schemes it does not use a table lookup or PLA for the initial step, resulting in a simpler implementation without any time penalty. The scheme can be integrated with division and incorporates an on-the-fly conversion and rounding of the result, thus eliminating a carry-propagate step to obtain the final result. The result-digit selection uses 3 bits of the result and 7 bits of the estimate of the residual.</p>
redundant result; on-the-fly rounding; radix-4 square-root algorithm; redundant residual; division; on-the-fly conversion; result-digit selection; digital arithmetic; logic arrays; number theory.
T. Lang and M. Ercegovac, "Radix-4 Square Rot Without Initial PLA," in IEEE Transactions on Computers, vol. 39, no. , pp. 1016-1024, 1990.