New residue to binary converters for the moduli set {2k, 2k−1, 2k-1−1}

Two new RNS to Binary converters for the moduli set {2^k, 2^k-1, 2^k-1-1} are presented. These proposed converters, one based on Chinese Remainder theorem and another based on Mixed radix Conversion are evaluated regarding hardware requirement and conversion delay and compared with other residue to binary converters proposed in literature for this moduli set as well as the moduli sets {2ⁿ-1, 2ⁿ, 2ⁿ+1} and {2^m-1, 2^m, 2^m+1-1}.