This paper presents a hybrid decimal division algorithm to improve division speed. The proposed hybrid algorithm employs either non-restoring or restoring algorithm on each digit to reduce iterative computations. The selection of the algorithm is based on the relative remainder values with respect to the half of its divisor. The proposed algorithm requires maximum 7n+4 add/subtract operations for an n-digit quotient, whereas other restoring or non-restoring schemes comprise more than 10n+1 operations.
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.
Copy
Yong-Dae KIM, Soon-Youl KWON, Seon-Kyoung HAN, Kyoung-Rok CHO, Younggap YOU, "A Hybrid Decimal Division Algorithm Reducing Computational Iterations" in IEICE TRANSACTIONS on Fundamentals,
vol. E89-A, no. 6, pp. 1807-1812, June 2006, doi: 10.1093/ietfec/e89-a.6.1807.
Abstract: This paper presents a hybrid decimal division algorithm to improve division speed. The proposed hybrid algorithm employs either non-restoring or restoring algorithm on each digit to reduce iterative computations. The selection of the algorithm is based on the relative remainder values with respect to the half of its divisor. The proposed algorithm requires maximum 7n+4 add/subtract operations for an n-digit quotient, whereas other restoring or non-restoring schemes comprise more than 10n+1 operations.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e89-a.6.1807/_p
Copy
@ARTICLE{e89-a_6_1807,
author={Yong-Dae KIM, Soon-Youl KWON, Seon-Kyoung HAN, Kyoung-Rok CHO, Younggap YOU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Hybrid Decimal Division Algorithm Reducing Computational Iterations},
year={2006},
volume={E89-A},
number={6},
pages={1807-1812},
abstract={This paper presents a hybrid decimal division algorithm to improve division speed. The proposed hybrid algorithm employs either non-restoring or restoring algorithm on each digit to reduce iterative computations. The selection of the algorithm is based on the relative remainder values with respect to the half of its divisor. The proposed algorithm requires maximum 7n+4 add/subtract operations for an n-digit quotient, whereas other restoring or non-restoring schemes comprise more than 10n+1 operations.},
keywords={},
doi={10.1093/ietfec/e89-a.6.1807},
ISSN={1745-1337},
month={June},}
Copy
TY - JOUR
TI - A Hybrid Decimal Division Algorithm Reducing Computational Iterations
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1807
EP - 1812
AU - Yong-Dae KIM
AU - Soon-Youl KWON
AU - Seon-Kyoung HAN
AU - Kyoung-Rok CHO
AU - Younggap YOU
PY - 2006
DO - 10.1093/ietfec/e89-a.6.1807
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E89-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 2006
AB - This paper presents a hybrid decimal division algorithm to improve division speed. The proposed hybrid algorithm employs either non-restoring or restoring algorithm on each digit to reduce iterative computations. The selection of the algorithm is based on the relative remainder values with respect to the half of its divisor. The proposed algorithm requires maximum 7n+4 add/subtract operations for an n-digit quotient, whereas other restoring or non-restoring schemes comprise more than 10n+1 operations.
ER -