This Article 
 Bibliographic References 
 Add to: 
A VLSI Algorithm for Computing the Euclidean Norm of a 3D Vector
October 2000 (vol. 49 no. 10)
pp. 1074-1082

Abstract—A digit-recurrence algorithm for computing the Euclidean norm of a three-dimensional (3D) vector which often appears in 3D computer graphics is proposed. One of the three squarings required for the usual computation is removed and the other two squarings, as well as the two additions, are overlapped with the square rooting. The Euclidean norm 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.

[1] N. Takagi and S. Kuwahara, “Digit-Recurrence Algorithm for Computing Euclidean Norm of a 3D Vector,” Proc. 14th Symp. Computer Arithmetic, pp. 86-93, Apr. 1999.
[2] A. Avizienis, “Signed-Digit Number Representations for Fast Parallel Arithmetic,” IRE Trans. Electronic Computers, vol. 10, pp. 389-400, Sept. 1961.
[3] M.D. Ercegovac and T. Lang,"On-the-Fly Conversion of Redundant into Conventional Representations," IEEE Trans. Computers, vol. 36, pp. 895-897, 1987.
[4] M.D. Ercegovac and T. Lang, Division and Square Root—Digit-Recurrence Algorithms and Implementations. Kluwer Academic, 1994.
[5] M.D. Ercegovac and T. Lang, “Radix-4 Square Root without Initial PLA,” Proc. Ninth Symp. Computer Arithmetic, pp. 162-168, Sept. 1989.
[6] M.D. Ercegovac and T. Lang, "On-the-Fly Rounding," IEEE Trans. Computers, vol. 41, no. 12, pp. 1,497-1,503, Dec. 1992.

Index Terms:
Computer arithmetic, Euclidean norm, VLSI algorithm, digit-recurrence algorithm, computer graphics.
Naofumi Takagi, Seiji Kuwahara, "A VLSI Algorithm for Computing the Euclidean Norm of a 3D Vector," IEEE Transactions on Computers, vol. 49, no. 10, pp. 1074-1082, Oct. 2000, doi:10.1109/12.888043
Usage of this product signifies your acceptance of the Terms of Use.