Issue No. 10 - October (1990 vol. 39)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.59853
<p>A general discussion on nonrestoring square root algorithms is presented, showing bounds and constraints delimiting the space of feasible algorithms, for all the choices of radix, digit set and representation of the partial remainder. Two classes of algorithms are then derived from the general discussion, and it is shown how it is possible to determine two parameters with a relevant impact on the implementation: the number of radicand bits to be inspected in order to obtain a starting value, and the number of partial remainder bits to be examined for digit selection. The algorithms for the specific case of radix 4 digit set (-2, -1, 0, +1, +2), and partial remainder represented in carry-save form are derived in order to show that the algorithms introduced can lead to better results than those obtained with algorithms previously presented.</p>
nonrestoring square root algorithms; bounds; constraints; feasible algorithms; radix; digit set; representation; radicand bits; starting value; partial remainder bits; digit selection; radix 4; carry-save; digital arithmetic; number theory.
P. Montuschi and L. Ciminiera, "Higher Radix Square Rooting," in IEEE Transactions on Computers, vol. 39, no. , pp. 1220-1231, 1990.