Efficient residue to binary converter

Residue number system to binary number system conversion is a very basic operation in any interface between the two systems. A five-moduli set, in which each modulus has a specific form is presented. The moduli set is defined as (2^k-2, 2^k-1, 2^k+1, 2^k-2^(k+1)2/+1, 2^k+2^(k+1)2/+1), where k is an odd positive integer. The multiplicative inverse of each modulus is expressed in a closed-form expression, which facilitates the conversion process. Realisation of the introduced converter is very attractive for many residue-based applications. The converter requires only a multi-operand adder. The delay and area of the new converter are considerably less than those previously reported in the literature.