Residue to binary number converters for (2n-1, 2n , 2n+1)

This paper proposes three new residue-to-binary converters using 2n- bit or n-bit adders for the three moduli residue number system of the form (2ⁿ-1, 2ⁿ, 2ⁿ+1). The 2n-bit adder based converter is faster and requires about half of the hardware required by previous methods. For n-bit adder based implementations, one new converter is twice as fast as the previous method using similar amount of hardware; while another new converter achieves improvement in both speed and area