Four-moduli set (2, 2n−1, 2n+2n−1−1, 2n+1+2n−1) simplies the residue to binary converters based on CRT II

A multiplier-free residue to binary converter architecture based on the Chinese remainder theorem II (CRT II) [1] is presented. The paper also includes a binary to residue converter. This is achieved by introducing a new moduli set (2, 2n − 1, 2n + 2n−1 − 1, 2n+1 + 2n − 1) for RNS application. The complexity of conversion has been greatly reduced using CRT II with the new moduli set. The proposed hardware architecture replaces the necessary multiplication by shift-left operations. A similar hardware architecture is presented for the binary to residue conversion.