TY  - JOUR
T1  - A Memoryless MRC Technique for RNS-to-Binary Conversion Using The Moduli Set (2<SUP>n</SUP>, 2<SUP>n</SUP>-1, 2<SUP>n-1</SUP>-1)
AU - , Kazeem Alagbe Gbolagade 
JO  - International Journal of Soft Computing
VL  - 4
IS  - 3
SP  - 127
EP  - 130
PY  - 2009
DA  - 2001/08/19
SN  - 1816-9503
DO  - ijscomp.2009.127.130
UR  - https://makhillpublications.co/view-article.php?doi=ijscomp.2009.127.130
KW  - Residue number system
KW  -reverse conversion
KW  -chinese remainder theorem
KW  -mixed radix conversion
KW  -moduli selection
KW  -multiplicative inverses
AB  - In this study, we investigate Residue Number System (RNS) to binary conversion, which is an important issue concerning the utilization of RNS numbers in Digital Signal Processing (DSP) applications. We present a Mixed Radix Conversion (MRC) technique for efficient RNS to binary conversion. First, we show that the computation of the required multiplicative inverses can be eliminated. Next, we propose an adder based RNS to binary converter, which requires mod-(2<SUP>n</SUP>-1) or mod-(2<SUP>n-1</SUP>-1) instead of mod-(2<SUP>n</SUP>) (2<SUP>n-1</SUP>-1) required by other state of the art Chinese Remainder Theorem (CRT) based equivalent converters. The proposed converter outperforms CRT based equivalent state of the art converters in terms of both speed and area. Consequently, due to the fact that our scheme operates on smaller magnitude operands, it results in less complex adders, which potentially results in faster implementation.
ER  -