A Hardware Algorithm for Computing Reciprocal Square Root

15th IEEE Symposium on Computer Arithmetic (ARITH-15 '01) p. 0094
A Hardware Algorithm for Computing Reciprocal Square Root
Naofumi Takagi, Nagoya University

Full Article Text:

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ARITH.2001.930108
Send link to a friend

Abstract
Abstract: 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, and 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.
Back to Top Additional Information
Citation: Naofumi Takagi, "A Hardware Algorithm for Computing Reciprocal Square Root," arith, p. 0094, 15th IEEE Symposium on Computer Arithmetic (ARITH-15 '01), 2001

	Advanced Search
CS Search Google Search