On the Design of Configurable Modulo 2n±1 Residue Generators

In this work new efficient modulo 2
ⁿ
+1 residue generators are proposed. The input operands are divided into n-bit vectors which are added by an inverted end around carry save adder tree and a final stage diminished-1 modulo 2
ⁿ
+1 adder. The conversion of the proposed residue generators to configurable modulo 2
ⁿ
±1 ones is also discussed. Modulo 2
ⁿ
±1 residue generators find applicability as forward converts from the binary to the residue number system, and in the design of self-checking digital systems.