An improvement in the restoring division algorithm (Needy Restoring Division Algorithm)

Abstract

An improvement in the current restoring computer division algorithm which minimizes the number of restorations performed by the computer. Currently, restoration is checked after each shifting of the register but Needy Restoring Division Algorithm checks restoration only when it is needed. The needless restorations are removed by the use of an extra register. This removal decreases the time for the division than taken in the current restoring division algorithm considerably.