An RNS to binary converter in a three moduli set with common factors

This paper describes a residue number to binary converter that converts numbers in the moduli set 2n+2, 2n+1, 2n with 2 as a common factor. An algorithm and a hardware implementation for the converter are proposed. The hardware implementation uses Chinese Remainder Theorem (CRT) and this has been made possible by mapping the moduli set into a pairwise relatively prime integers to satisfy CRT requirements. Properties of modular arithmetic are used to reduce the complexity of the multipliers in the proposed hardware. The converter does not use any explicit module operation in the evaluation as is normally done in implementations that use CRT