论文信息 - A hardware algorithm for computing reciprocal square root

A hardware algorithm for computing reciprocal square root

A hardware algorithm for computing the reciprocal square root which appears frequently in multimedia and graphics applications is proposed. The reciprocal square root is computed by iteration of carry-propagation-free additions, shifts, and multiplications by one digit. Different specific versions of the algorithm are possible, depending on the radix, the redundancy factor of the digit set, etc. Each version of the algorithm can be implemented as a sequential (folded) circuit or a combinational (unfolded) circuit, which has a regular array structure suitable for VLSI.

Naofumi Takagi

[1] Arnaud Tisserand,et al. Reciprocation, square root, inverse square root, and some elementary functions using small multipliers , 1998, Optics & Photonics.

[2] Naofumi Takagi. Powering by a Table Look-Up and a Multiplication with Operand Modification , 1998, IEEE Trans. Computers.

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

[4] Weng-Fai Wong,et al. Fast Hardware-Based Algorithms for Elementary Function Computations Using Rectangular Multipliers , 1994, IEEE Trans. Computers.

[5] Tomás Lang,et al. On-the-Fly Conversion of Redundant into Conventional Representations , 1987, IEEE Transactions on Computers.

[6] Javier D. Bruguera,et al. Computation of sqrt(x/d) in a Very High Radix Combined Division/Square-Root Unit with Scaling , 1998, IEEE Trans. Computers.