A new algorithm for reducing the division operation to a series of smaller divisions is introduced. Partitioning the dividend into segments, we perform divisions, shifts, and accumulations taking into account the weight of dividend bits. Each partial division can be performed by any existing division algorithm. From an algorithmic point of view, computation analysis is performed in comparison with the existing algorithms. From an implementation point of view, since the division can be performed by any existing divider, the designer can choose the divider which best meets his specifications. Although the algorithm is presented for integer numbers, it can be easily generalized for fractions, since it is only a matter of representation. Two possible implementations of the algorithm, namely the sequential and parallel are derived, with several variations, allowing performance, cost, and cost/performance trade-offs. Exhaustive comparisons of the derived implementations with many existing implementations in terms of area cost, performance, and cost/performance are done. A plethora of alternative implementations can be derived due to a variable number of partitions.
Analysis of the Pope-stein division algorithm
