.png){kind=icon}
返回
A digit-by-digit algorithm for mth root extraction
.png){kind=icon}
PRE
AI
DOI：10.1109/TC.2007.70764.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
integer rooting
digit-by-digit algorithms
higher radix
computer arithmetic
期刊
IF:
3.8
论文数:
5.3K
被引数:
9.8K
机构
暂无机构信息
引用论文
In vitro influence of Phaseolus vulgaris, Griffonia simplicifolia, concanavalin A, wheat germ, and peanut agglutinins on HCT-15, LoVo, and SW837 human colorectal cancer cell growth..png)
Gut
OAAI
GutIF0
OAAI分享收藏 没有更多内容
没有更多内容