This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Digit-by-Digit Algorithm for mth Root Extraction
December 2007 (vol. 56 no. 12)
pp. 1696-1706
ASCII Text
x 
 
Paolo Montuschi, Javier D. Bruguera, Luigi Ciminiera, José-Alejandro Piñeiro, "A Digit-by-Digit Algorithm for mth Root Extraction," IEEE Transactions on Computers, vol. 56, no. 12, pp. 1696-1706, December, 2007.
 
 
BibTex
x
 
@article{ 10.1109/TC.2007.70764,
author = {Paolo Montuschi and Javier D. Bruguera and Luigi Ciminiera and José-Alejandro Piñeiro},
title = {A Digit-by-Digit Algorithm for mth Root Extraction},
journal ={IEEE Transactions on Computers},
volume = {56},
number = {12},
issn = {0018-9340},
year = {2007},
pages = {1696-1706},
doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2007.70764},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - A Digit-by-Digit Algorithm for mth Root Extraction
IS - 12
SN - 0018-9340
SP1696
EP1706
EPD - 1696-1706
A1 - Paolo Montuschi,
A1 - Javier D. Bruguera,
A1 - Luigi Ciminiera,
A1 - José-Alejandro Piñeiro,
PY - 2007
KW - integer rooting
KW - digit-by-digit algorithms
KW - higher radix
KW - computer arithmetic
VL - 56
JA - IEEE Transactions on Computers
ER -
 
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.

[1] E. Antelo, T. Lang, and J. Bruguera, “Computation of $\sqrt{x/d}$ in a Very High Radix Combined Division/Square-Root Unit with Scaling,” IEEE Trans. Computers, vol. 47, no. 2, pp. 152-161, Feb. 1998.
[2] L. Ciminiera and P. Montuschi, “Higher Radix Square Rooting,” IEEE Trans. Computers, vol. 39, no. 10, pp. 1220-1231, Oct. 1990.
[3] J. Cortadella and T. Lang, “High-Radix Division and Square Root with Speculation,” IEEE Trans. Computers, vol. 43, no. 8, pp. 919-931, Aug. 1994.
[4] D. DasSarma and D.W. Matula, “Faithful Bipartite ROM Reciprocal Tables,” Proc. 12th IEEE Symp. Computer Arithmetic, pp. 12-25, July 1995.
[5] M.D. Ercegovac, “A General Hardware-Oriented Method for Evaluation of Functions and Computations in a Digital Computer,” IEEE Trans. Computers, vol. 26, no. 7, pp. 667-680, July 1977.
[6] M.D. Ercegovac and T. Lang, “On-the-Fly Conversion of Redundant into Conventional Representations,” IEEE Trans. Computers, vol. 36, no. 7, pp. 895-897, July 1987.
[7] M.D. Ercegovac and T. Lang, “Radix-4 Square Root without Initial PLA,” IEEE Trans. Computers, vol. 39, no. 8, pp. 1016-1024, Aug. 1990.
[8] M.D. Ercegovac and T. Lang, Algorithms for Division and Square Root. Kluwer Academic, 1994.
[9] M.D. Ercegovac and T. Lang, Digital Arithmetic. Morgan Kaufmann, 2003.
[10] A.S. Glassner, Principles of Digital Image Synthesis. Morgan Kaufmann, 1995.
[11] J.-M. Muller, Elementary Functions Algorithms and Implementation. Birkhauser, 1997.
[12] S.F. Oberman, “Floating Point Division and Square Root Algorithms and Implementation in the AMD-K7 Microprocessor,” Proc. 14th IEEE Symp. Computer Arithmetic, pp. 106-115, July 1999.
[13] J.-A. Piñeiro, M.D. Ercegovac, and J.D. Bruguera, “Algorithm and Architecture for Logarithm, Exponential, and Powering Computation,” IEEE Trans. Computers, vol. 53, no. 9, pp. 1085-1096, Sept. 2004.
[14] J.-A. Piñeiro, J.D. Bruguera, L. Ciminiera, and P. Montuschi, “A Digit-by-Digit Algorithm for Radix-2 Cube Root and Its Implementation,” technical report, http:/www.ac.usc.es, 2004.
[15] M.J. Schulte and J.E. Stine, “The Symmetric Table Addition Method for Accurate Function Approximation,” J. VLSI Signal Processing, vol. 21, no. 2, pp. 167-177, 1999.
[16] M.J. Schulte and J.E. Stine, “Approximating Elementary Functions with Symmetric Bipartite Tables,” IEEE Trans. Computers, vol. 48, no. 8, pp. 842-847, Aug. 1999.
[17] N. Takagi, “A Digit-Recurrence Algorithm for Cube Rooting,” IEICE Trans. Fundamentals, vol. E84-A, no. 5, pp. 1309-1314, May 2001.

Index Terms:
integer rooting, digit-by-digit algorithms, higher radix, computer arithmetic
Citation:
Paolo Montuschi, Javier D. Bruguera, Luigi Ciminiera, José-Alejandro Piñeiro, "A Digit-by-Digit Algorithm for mth Root Extraction," IEEE Transactions on Computers, vol. 56, no. 12, pp. 1696-1706, Dec. 2007, doi:10.1109/TC.2007.70764
Usage of this product signifies your acceptance of the Terms of Use.