“A novel implementation method for addition and subtraction in residue number systems”

This paper describes a novel implementation scheme for the operations of addition and subtraction in the residue number systems. The method is based on the property that the set of residues modulo m form a finite group under addition (mod m). Therefore, any row in the modulo m addition table is simply a permutation of the elements of any other row. The effect of this on the implementation scheme is as follows: The set of residues modulo m (o to m−1) are held in a register. For operands X and Y, X is used to permute the contents of the register and Y is used to select the appropriate part of the register to be gated into the sum register.