Successive Approximation Algorithm for Binary Division of Unsigned Integers

Authors

  • Pritam Bhattacharyya Author

Keywords:

Successive approximation, algorithm, binary division, restoring division, non-restoring division, unsigned integer.

Abstract

This paper presents an efficient binary division 
algorithm. It is assumed that both the divisor and the dividend are unsigned binary integers. The algorithm employs a successive approximation approach to perform the division. Theoretically, it will take [n – m + 3] number of steps to perform a division, where n and m are the number of bits of the dividend and the divisor respectively. The best case of the algorithm occurs when n ≤ m and it will then take two steps for its complete execution.

Downloads

Download data is not yet available.

Downloads

Published

06.07.2012

How to Cite

Successive Approximation Algorithm for Binary Division of Unsigned Integers . (2012). International Journal of Information and Electronics Engineering, 2(4), 621-624. https://www.ijiee.org/index.php/ijiee/article/view/187