Computation of sqrt(x/d) in a Very High Radix Combined Division/Square-Root Unit with Scaling

A very-high radix digit-recurrence algorithm for the operation /spl radic/(x/d) is developed, with residual scaling and digit selection by rounding. This is an extension of the division and square-root algorithms presented previously, and for which a combined unit was shown to provide a fast execution of these operations. The architecture of a combined unit to execute division, square-root, and /spl radic/(x/d) is described, with inverse square-root as a special case. A comparison with the corresponding combined division and square-root unit shows a similar cycle time and an increase of one cycle for the extended operation with respect to square-root. To obtain an exactly rounded result for the extended operation a datapath of about 2n bits is needed. An alternative is proposed which requires approximately the same width as for square-root, but produces a result with an error of less than one ulp. The area increase with respect to the division and square root unit should be no greater than 15 percent. Consequently, whenever a very high radix unit for division and square-root seems suitable, it might be profitable to implement the extended unit instead.

[1]  Michael J. Flynn,et al.  Parallel High-Radix Nonrestoring Division , 1993, IEEE Trans. Computers.

[2]  Milos D. Ercegovac,et al.  A higher-radix division with simple selection of quotient digits , 1983, 1983 IEEE 6th Symposium on Computer Arithmetic (ARITH).

[3]  Debjit Das Sarma,et al.  Faithful bipartite ROM reciprocal tables , 1995, Proceedings of the 12th Symposium on Computer Arithmetic.

[4]  Michael J. Flynn,et al.  Fast Division Using Accurate Quotient Approximations to Reduce the Number of Iterations , 1992, IEEE Trans. Computers.

[5]  Earl E. Swartzlander,et al.  Cascaded implementation of an iterative inverse-square-root algorithm, with overflow lookahead , 1995, Proceedings of the 12th Symposium on Computer Arithmetic.

[6]  Tomás Lang,et al.  Very-high radix combined division and square root with prescaling and selection by rounding , 1995, Proceedings of the 12th Symposium on Computer Arithmetic.

[7]  Tomás Lang,et al.  Very-High Radix Division with Prescaling and Selection by Rounding , 1994, IEEE Trans. Computers.

[8]  M. Ercegovac,et al.  Division and Square Root: Digit-Recurrence Algorithms and Implementations , 1994 .

[9]  Michael J. Flynn,et al.  Hardware starting approximation for the square root operation , 1993, Proceedings of IEEE 11th Symposium on Computer Arithmetic.

[10]  Masaki Kobayashi,et al.  A new DSP-oriented algorithm for calculation of the square root using a nonlinear digital filter , 1992, IEEE Trans. Signal Process..

[11]  Shuzo Yajima,et al.  Efficient initial approximation and fast converging methods for division and square root , 1995, Proceedings of the 12th Symposium on Computer Arithmetic.