It is widely known that a computer adder can be checked by a completely independent circuit using check symbols that are residues of the numbers modulo some base. This paper describes such a residue checking system and shows, moreover, that independent adding and checking circuits are possible only with systems of this type. The discussion includes a method of handling residue-class check symbols when overflow occurs.
Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.