The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
큐브 루팅을 위한 숫자 반복 알고리즘이 제안되었습니다. 세제곱근 계산에서 잔차의 숫자-재귀 방정식에는 세제곱근 부분 결과의 제곱이 포함됩니다. 제안된 알고리즘에서는 부분 결과의 제곱을 유지하고 제곱은 물론 잔차도 XNUMX자리 또는 XNUMX자리의 덧셈/뺄셈, 이동, 곱셈을 통해 업데이트됩니다. 기수, 세제곱근의 숫자 집합 등에 따라 다양한 특정 버전의 알고리즘이 가능합니다. 모든 버전의 알고리즘은 순차(접힌) 회로 또는 조합(펼친) 회로로 구현될 수 있습니다. VLSI 구현에 적합합니다.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Naofumi TAKAGI, "A Digit-Recurrence Algorithm for Cube Rooting" in IEICE TRANSACTIONS on Fundamentals,
vol. E84-A, no. 5, pp. 1309-1314, May 2001, doi: .
Abstract: A digit-recurrence algorithm for cube rooting is proposed. In cube rooting, the digit-recurrence equation of the residual includes the square of the partial result of the cube root. In the proposed algorithm, the square of the partial result is kept, and the square, as well as the residual, is updated by addition/subtraction, shift, and multiplication by one or two digits. Different specific versions of the algorithm are possible, depending on the radix, the digit set of the cube root, and etc. Any version of the algorithm can be implemented as a sequential (folded) circuit or a combinational (unfolded) circuit, which is suitable for VLSI realization.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e84-a_5_1309/_p
부
@ARTICLE{e84-a_5_1309,
author={Naofumi TAKAGI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Digit-Recurrence Algorithm for Cube Rooting},
year={2001},
volume={E84-A},
number={5},
pages={1309-1314},
abstract={A digit-recurrence algorithm for cube rooting is proposed. In cube rooting, the digit-recurrence equation of the residual includes the square of the partial result of the cube root. In the proposed algorithm, the square of the partial result is kept, and the square, as well as the residual, is updated by addition/subtraction, shift, and multiplication by one or two digits. Different specific versions of the algorithm are possible, depending on the radix, the digit set of the cube root, and etc. Any version of the algorithm can be implemented as a sequential (folded) circuit or a combinational (unfolded) circuit, which is suitable for VLSI realization.},
keywords={},
doi={},
ISSN={},
month={May},}
부
TY - JOUR
TI - A Digit-Recurrence Algorithm for Cube Rooting
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1309
EP - 1314
AU - Naofumi TAKAGI
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E84-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2001
AB - A digit-recurrence algorithm for cube rooting is proposed. In cube rooting, the digit-recurrence equation of the residual includes the square of the partial result of the cube root. In the proposed algorithm, the square of the partial result is kept, and the square, as well as the residual, is updated by addition/subtraction, shift, and multiplication by one or two digits. Different specific versions of the algorithm are possible, depending on the radix, the digit set of the cube root, and etc. Any version of the algorithm can be implemented as a sequential (folded) circuit or a combinational (unfolded) circuit, which is suitable for VLSI realization.
ER -