An Efficient CRT Based Reverse Converter for {22n+1-1, 2n-1, 22n-1} Moduli Set

This paper presents a reverse converter for the moduli set {22n+1-1, 2n-1, 22n-1} using a Chinese Remainder Theorem (CRT) algorithm and reverse method of data conversion. We compare our result with other converters found in literature that have the same Dynamic Range (DR) and our proposed algorithm has a better performance in terms of speed.

Aims: The aim of this study is to design a reverse converter for the moduli set {22n+1-1, 2n-1, 22n-1}, determine the speed and compare it with other moduli set with the same DR in literature.

Methodology: We applied Chinese Reminder Theorem algorithm for data conversion.