Sciweavers

Share
ARITH
2003
IEEE

High-Radix Iterative Algorithm for Powering Computation

11 years 10 months ago
High-Radix Iterative Algorithm for Powering Computation
A high-radix composite algorithm for the computation of the powering function (¤¦¥ ) is presented in this paper. The algorithm consists of a sequence of overlapped operations: (i) digitrecurrence logarithm, (ii) left-to-right carry-free (LRCF) multiplications, and (iii) on-line exponential. A redundant number system is used, and the selection in (i) and (iii) is done by rounding except from the first iteration, when selection by table look-up is necessary to guarantee the convergence of the recurrences. A sequential implementation of the algorithm is proposed, and the execution times and hardware requirements are estimated for single and double-precision floating-point computations, for radix §©¨ , showing that powering can be computed with similar performance as high-radix CORDIC algorithms.
José-Alejandro Piñeiro, Milos D. Erc
Added 04 Jul 2010
Updated 04 Jul 2010
Type Conference
Year 2003
Where ARITH
Authors José-Alejandro Piñeiro, Milos D. Ercegovac, Javier D. Bruguera
Comments (0)
books