ABSTRACT
This chapter presents several additional topics in computer arithmetic, including residue checking. Residue checking is a significant application that is especially suitable for addition, subtraction, and multiplication. This is a method of checking the accuracy of an arithmetic operation and is done in parallel with the operation. Residue checking will be implemented for an add operation. A combinational array can be used for residue checking in much the same way as an array was used for fixed-point division. The divisor, however, is a constant value of three that represents the modulus. The array generates a remainder which is the residue and has binary values of 00, 01, or 10. The organization for the residue generator is using a division array complete with instantiation names and net names. The carry-out of the high-order cell in each row represents the quotient bit for that row.
