ABSTRACT
The number of steps in the previously described division methods was linearly proportional to the number of bits, n, while in the division-by-convergence schemes, which will be described in this chapter, the number of steps is proportional to loge n. However, the basic operation in the division-by-convergence schemes is not an add/subtract operation but the usually slower multiply operation. Hence, a fast parallel multiplier is necessary to successfully implement these schemes.
