An RNS to binary converter in 2n+1, 2n, 2n -1 moduli set

A residue number system to binary converter that converts numbers in the moduli set 2n+1,2n,2n-1 is described. This moduli set is an extension of the more popular set, 2ⁿ+1, 2ⁿ, 2ⁿ-1. A low-complexity implementation using some properties of modular arithmetic is proposed. The converter does not use any explicit modulo operation in the evaluation as is normally done in the Chinese remainder theorem