.png){kind=icon}
.png){kind=icon}
Return
A digit-by-digit algorithm for mth root extraction
.png){kind=icon}
PRE
AI
DOI：10.1109/TC.2007.70764.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A general digit-recurrence algorithm for the computation of the mth root (with an m integer) is presented in this paper. Based on the concept of completing the mth 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 mth rooting is also studied, together with closed formulas for both the digit selection rules and the number of bits required to perform correct selections.
Keywords:
integer rooting
digit-by-digit algorithms
higher radix
computer arithmetic
Journal
IF:
3.8
Papers:
5.3K
Citations:
9.8K
Organization
No organization information available