RNS-to-binary converter for a new three-moduli set {2n+1-1, 2n, 2n-1}

In this brief, the design of residue number system (RNS) to binary converters for a new powers-of-two related three-moduli set { 2(n+1) - 1, 2(n), 2(n) - 1} is considered. This moduli set uses moduli of uniform word length (n to n + 1 bits). It is derived from a previously investigated four-moduli set { 2(n) - 1, 2(n), 2(n) + 1,2(n+1) - 1}. Three RNS-to-binary converters are proposed for this moduli set: one using mixed radix conversion and the other two using Chinese Remainder Theorem. Detailed architectures of the three converters as well as comparison with some earlier proposed converters for three-moduli sets with uniform word length and the four-moduli set { 2(n) - 1, 2(n), 2(n) + 1, 2(n+ 1) - 1} are presented.