Study of error control capability for the new moduli set \({2^{2n+1}+2^{n}-1, 2^{2n+1}-1, 2^{n}-1, 2^{3n},2^{3n+1}-1}\)
About this article
Abstract
In this paper, a new 3-moduli set {22n+1+2n-1, 22n+1-1, 2n-1} with an efficient residue-to-binary converter using mixed radix conversion algorithm is presented. Moreover, by adding two redundant modulus {23n, 23n+1-1}, a new moduli set in redundant residue number system is provided that can correct up to (2n+2) error bits. Simulation results of the error control algorithm's functionality with C++ programming language for 10'000 different error bits states show that the average percent of error detection capability using the proposed moduli set by setting n=2 is equal to 77.97%.References
[1] W. Wei, M.N.S. Swamy, M.O. Ahmad, ”RNS application for digital image processing”, Proceedings of the 4th IEEE international workshop on system-on-chip for real time applications, Canada, (2004), pp. 77-80.
[2] F. Taylor, ”A single modulus ALU for signal processing”, IEEE Transactions on Acoustics, Signal Processing, Vol. 33, (1985), pp. 1302-1315.
[3] S. Yen, S. Kim, S. Lim, S. Moon, ”RSA speedup with Chinese remainder theorem immune against hardware fault cryptanalysis”, IEEE Transactions on Computers, Vol. 52, No. 4, (2003), pp. 461-472.
[4] E. Kinoshita, K. Lee, ”A residue arithmetic extension for reliable scientific computation”, IEEE Transactions on Computers, Vol. 46, No. 2, (1997), pp. 129-138.
[5] R. Convey, J. Nelson, ”Improved RNS FIR filter architectures”, IEEE Transactions on Circuits and Systems-II, Vol. 51, No. 1, (2004), pp. 26-28.
View more references (12)
[6] K.M. Elleithy, M.A. Bayoumi, Fast and flexible architectures for RNS arithmetic decoding”, IEEE Transactions on Circuits and Systems-II, Vol. 39, No. 4, (1992), pp. 226-235.
[7] C.H. Huang, ”A fully parallel mixed radix conversion algorithm for residue number applications”, IEEE Transactions on Computer, Vol. 32, No. 4, (1983), pp. 398-402.
[8] P.V.A. Mohan, ”Evaluation of fast conversion technique for binary-residue number systems”, IEEE Transactions on Circuit and Systems-I, Vol. 45, No. 10, (1998), pp. 1107-1109.
[9] P.V.A. Mohan, ”The digit parallel method for fast RNS to weighted number system conversion for specific moduli (2n-1, 2n, 2n+1)”, IEEE Transactions on Circuits and Systems-II, Vol. 47, No. 9, (2000), pp. 972-974.
[10] P.V.A. Mohan, ”Breaking the 2n-bit carry propagation barrier in residue to binary conversion for the (2n-1, 2n, 2n+1) moduli set”, IEEE Transactions on Circuits and Systems-II, Vol. 48, No. 8, (2001), pp. 1031-1035.
[11] F.J. Taylor, ”Residue arithmetic: A tutorial with examples”, IEEE Computer Magazine, Vol. 17, No. 5, (1984), pp. 50-62.
[12] S.J. Piestrak, ”A high speed realization of a residue to binary converter”, IEEE Transactions on Circuits and Systems. II, Analogue and digital Signal Processing, Vol. 42, No. 10, (1995), pp. 661-663.
[13] A. Hariri, K. Navi, R. Rastegar, ”A new high dynamic range moduli set with efficient reverse converter”, Elsevier/ Journal of Computation and Mathematics with Applications, Vol. 55, No. 4, (2008), pp. 660-668.
[14] A.S. Molahossenin, K. Navi, C. Dadkhah, S. Timarchi, ”Efficient reverse converter designs for the new 4-moduli sets {2n-1, 2n, 2n+1, 22n+1-1} and {2n-1, 2n+1, 22n, 22n+1} based on new CRTs”, IEEE Transactions on Circuits and Systems-I: Regular papers, Vol. 57, No. 4, (2010), pp. 1-13.
[15] B. Cao, C.H. Chang, T.H. Srikanthan, ”A residue to binary converter for a new five moduli set”, IEEE Transactions on Circuits and Systems – I: Regular papers, Vol. 54, No.5, (2007), pp. 1041-1049.
[16] P.V.A. Mohan, A.B. Premkumar, ”RNS to binary converters for two four moduli set {2n-1, 2n, 2n+1, 2n+1-1} and {2n-1, 2n, 2n+1, 2n+1+1}”, IEEE Transactions on Circuits and Systems- I: Regular papers, Vol. 24, No.6, (2007), pp. 1245-1254.
[17] P.V.A. Mohan, ”New reverse converters for the moduli set {2n-3, 2n-1, 2n+1, 2n+3}”, Elsevier/ International Journal of Electronics and Communications (AEU), Vol. 62, No. 9, (2008), pp. 643- 658.