A Digit-by-Digit Algorithm for mth Root Extraction

Authors:
Paolo Montuschi;Javier D. Bruguera;Luigi Ciminiera;José-Alejandro Piñeiro
Affiliations:
-;-;-;-
Venue:
IEEE Transactions on Computers
Year:
2007

Citing 12
Cited 0

On-the-fly conversion of redundant into conventional representations

IEEE Transactions on Computers
Radix-4 Square Rot Without Initial PLA

IEEE Transactions on Computers
Higher Radix Square Rooting

IEEE Transactions on Computers
Elementary functions: algorithms and implementation

Elementary functions: algorithms and implementation
Computation of $\sqrt {{x \mathord{\left/ {\vphantom {x d}} \right. \kern-\nulldelimiterspace} d}}$ in a Very High Radix Combined Division/Square-Root Unit with Scaling and Selection by Rounding

IEEE Transactions on Computers
Approximating Elementary Functions with Symmetric Bipartite Tables

IEEE Transactions on Computers
Principles of Digital Image Synthesis

Principles of Digital Image Synthesis
The Symmetric Table Addition Method for Accurate Function Approximation

Journal of VLSI Signal Processing Systems
High-Radix Division and Square-Root with Speculation

IEEE Transactions on Computers
Floating Point Division and Square Root Algorithms and Implementation in the AMD-K7 Microprocessor

ARITH '99 Proceedings of the 14th IEEE Symposium on Computer Arithmetic
Algorithm and Architecture for Logarithm, Exponential, and Powering Computation

IEEE Transactions on Computers
A General Hardware-Oriented Method for Evaluation of Functions and Computations in a Digital Computer

IEEE Transactions on Computers

Quantified Score

Hi-index	14.98

Visualization

Abstract

A general digit-recurrence algorithm for the computation of the m-th root (with m integer) is presented in this paper. Based on the concept of completing the m-th root, a detailed analysis of the convergence conditions is performed and iteration-independent digit-selection rules are obtained for any radix and redundant digit set. A radix- 2 version for m-th rooting is also studied, together with closed formulas for both the digit selection rules and the number of bits required to perform correct selections.