Residue-to-binary converters for the moduli set {22n+1-1,22n,2n-1}

In this paper, we propose two memoryless converters for the moduli set {22n+1 -1,22n,2n -1}. First, we propose a novel reverse converter, which is purely adder based, using the traditional Chinese Remainder Theorem (CRT). Second, due to the fact that the proposed CRT based structure does not cover the entire dynamic range, a second converter, which covers the entire dynamic range based on Mixed Radix Conversion (MRC), is proposed. The CRT based converter outperforms the MRC based converter both in terms of area and delay. In comparison with related best known state of the art converters, they are all outperformed by the proposed CRT based scheme in terms of both area cost and conversion delay. The theoretical evaluation is supported by the experimental results, which are estimated on a Standard Cell 0.13-µm CMOS technology. These experimental results indicate that, on average, for the same dynamic range, the proposed CRT based converter achieves about 23% delay reduction with more than 3% area reduction, when compared to the existing state of the art MRC based converter. Additionally, the proposed CRT based converter is about 6% faster with about 4% area reduction when compared with the existing CRT based converter.

[1]  A. Benjamin Premkumar,et al.  A Memoryless Reverse Converter for the 4-Moduli Superset {2n-1, 2n, 2n+1, 2n+1-1} , 2000, J. Circuits Syst. Comput..

[2]  A. Hiasat,et al.  Residue-to-binary arithmetic converter for the moduli set (2/sup k/, 2/sup k/-1, 2/sup k-1/-1) , 1998 .

[3]  A. S. Molahosseini,et al.  A New Residue to Binary Converter Based on Mixed-Radix Conversion , 2008, 2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications.

[4]  S. Cotofana,et al.  Residue Number System operands to decimal conversion for 3-moduli sets , 2008, 2008 51st Midwest Symposium on Circuits and Systems.

[5]  Keivan Navi,et al.  New Arithmetic Residue to Binary Converters , 2007 .

[6]  Yuke Wang Residue-to-binary converters based on new Chinese remainder theorems , 2000 .

[7]  Ricardo Chaves,et al.  Improving residue number system multiplication with more balanced moduli sets and enhanced modular arithmetic structures , 2007, IET Comput. Digit. Tech..

[8]  Ricardo Chaves,et al.  An improved RNS reverse converter for the {22n+1−1, 2n, 2n−1} moduli set , 2010, Proceedings of 2010 IEEE International Symposium on Circuits and Systems.

[9]  SheuMing-Hwa,et al.  Efficient VLSI Design of Residue-to-Binary Converter for the Moduli Set (2n, 2n+1-1, 2n-1) , 2008 .

[10]  Hoda S. Abdel-Aty-Zohdy,et al.  Residue-to-binary arithmetic converter for the moduli set (2k, 2k - 1, 2k-1 - 1) , 1998 .

[11]  Richard I. Tanaka,et al.  Residue arithmetic and its applications to computer technology , 1967 .

[12]  Tokunbo Ogunfunmi,et al.  2nd International Conference on Adaptive Science & Technology , 2009 .

[13]  Ming-Hwa Sheu,et al.  Efficient VLSI Design of Residue-to-Binary Converter for the Moduli Set (2n, 2n+1 - 1, 2n - 1) , 2008, IEICE Trans. Inf. Syst..

[14]  P. V. Ananda Mohan,et al.  RNS-To-Binary Converter for a New Three-Moduli Set $\{2^{{n}+1}-1,2^{n},2^{n}-1\}$ , 2007, IEEE Transactions on Circuits and Systems II: Express Briefs.