Digit-recurrence algorithms for division and square root with limited precision primitives

We propose a digit-recurrence algorithm for square root using limited-precision multipliers, adders, and table-lookups. The algorithm, except in the initialization, uses the digit-recurrence algorithm for division with limited-precision primitives reported in (M.D. Ercegovac, et al., (2001)). Consequently, a combined scheme for division and square root is easily realized. We describe the algorithms and discuss a combined division/square-root design. Compared to a conventional implementation with full-precision primitives, the proposed scheme is estimated to have a longer cycle time and a significantly smaller area with a corresponding effect on power dissipation making the scheme interesting for low-power designs. This class of algorithms is suitable for higher radix implementation.