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.
Index Terms—Successive approximation, algorithm, binary division, restoring division, non-restoring division, unsigned integer.
Pritam Bhattacharyya is with Dept. of Electronics and Communication Engineering, Guru Nanak Institute of Technology, India (e-mail:firstname.lastname@example.org).
Cite: Pritam Bhattacharyya, "Successive Approximation Algorithm for Binary Division of Unsigned Integers," International Journal of Information and Electronics Engineering vol. 2, no. 4, pp. 621-624, 2012.