A Simple Postcorrection for Nonrestoring Division

The nonrestoring division algorithm offers the advantages of speed and logical simplicity when working with signed, two´s-complement binary numbers. The algorithm does not assure sign agreement between the calculated quotient and remainder, however, which is a disadvantage in some applications. This paper describes a postcorrection that will force sign agreement between quotient and remainder. The corrective operation is very simple to implement, especially in microprogrammed arithmetic units.