Successive Approximation Algorithm for Binary Division of Unsigned Integers
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
Downloads
Published
Issue
Section
License
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.