Radix-2 division with quotient digit prediction without prescaling

We analyse an SRT radix-2 division algorithm where the determination of the quotient digits is performed in parallel with the update of the residual. We show that this digit prediction requires a simple selection function. Our algorithm does not need any prescaling as, on the other hand, it is required from other prediction-based techniques in order to reduce the complexity of the selection function. We estimate that the proposed algorithm can achieve execution times comparable to the computation delay of the "classical" radix-4 division algorithm with maximally redundant digit set, but requires a smaller amount of hardware.<>