A Hybrid Decimal Division Algorithm Reducing Computational Iterations

Yong-Dae KIM  Soon-Youl KWON  Seon-Kyoung HAN  Kyoung-Rok CHO  Younggap YOU  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E89-A   No.6   pp.1807-1812
Publication Date: 2006/06/01
Online ISSN: 1745-1337
DOI: 10.1093/ietfec/e89-a.6.1807
Print ISSN: 0916-8508
Type of Manuscript: PAPER
Category: Numerical Analysis and Optimization
decimal division,  BCD,  restoring,  non-restoring,  

Full Text: PDF(479.1KB)>>
Buy this Article

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.