On-the-fly conversion of redundant into conventional representations
IEEE Transactions on Computers
Division and Square Root: Digit-Recurrence Algorithms and Implementations
Division and Square Root: Digit-Recurrence Algorithms and Implementations
On-the-Fly Rounding (Computing Arithmetic)
IEEE Transactions on Computers
Digit-Recurrence Algorithm for Computing Euclidean Norm of a 3-D Vector
ARITH '99 Proceedings of the 14th IEEE Symposium on Computer Arithmetic
Hardware support for adaptive tessellation of Bézier surfaces based on local tests
Journal of Systems Architecture: the EUROMICRO Journal
High-performance hardware operators for polynomial evaluation
International Journal of High Performance Systems Architecture
Hi-index | 14.98 |
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.