{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T16:10:04Z","timestamp":1746202204323,"version":"3.40.4"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2014,4,29]],"date-time":"2014-04-29T00:00:00Z","timestamp":1398729600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Circuits Syst Signal Process"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1007\/s00034-014-9798-1","type":"journal-article","created":{"date-parts":[[2014,4,28]],"date-time":"2014-04-28T12:05:12Z","timestamp":1398686712000},"page":"3145-3163","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Efficient Reverse Converters for 4-Moduli Sets {2 $$^{2n-1}-1$$ 2 n - 1 - 1 , 2 $$^{n}$$ n , 2 $$^{n}+1$$ n + 1 , 2 $$^{n}-1$$ n - 1 } and {2 $$^{2n-1}$$ 2 n - 1 , 2 $$^{2n-1}-1$$ 2 n - 1 - 1 , 2 $$^{n}+1$$ n + 1 , 2 $$^{n}-1$$ n - 1 } Based on CRTs Algorithm"],"prefix":"10.1007","volume":"33","author":[{"given":"Mohammad Reza","family":"Noorimehr","sequence":"first","affiliation":[]},{"given":"Mehdi","family":"Hosseinzadeh","sequence":"additional","affiliation":[]},{"given":"Keivan","family":"Navi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,4,29]]},"reference":[{"key":"9798_CR1","doi-asserted-by":"crossref","first-page":"1441","DOI":"10.1109\/31.14470","volume":"35","author":"S Andraros","year":"1988","unstructured":"S. Andraros, H. Ahmad, A new efficient memory-less residue to binary converter. IEEE Trans. Circuits Syst. 35, 1441\u20131444 (1988)","journal-title":"IEEE Trans. Circuits Syst."},{"issue":"6","key":"9798_CR2","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1109\/TC.2004.2","volume":"53","author":"JC Bajard","year":"2004","unstructured":"J.C. Bajard, L. Imbert, Brief contributions: a full implementation RSA in RNS. IEEE Trans. Comput. 53(6), 769\u2013774 (2004)","journal-title":"IEEE Trans. Comput."},{"key":"9798_CR3","doi-asserted-by":"crossref","unstructured":"M. Bhardwaj, T. Srikanthan, C.T. Clarke, A reverse converter for the 4 moduli super set $$\\{2^{n}-1, 2^{n}, 2^{n}+1, 2^{n+1}+1\\}$$ { 2 n - 1 , 2 n , 2 n + 1 , 2 n + 1 + 1 } . IEEE Conference on Computer Arithmetic, 1999, pp. 168\u2013175","DOI":"10.1109\/ARITH.1999.762842"},{"key":"9798_CR4","doi-asserted-by":"crossref","first-page":"1296","DOI":"10.1109\/TCSI.2003.817789","volume":"50","author":"B Cao","year":"2003","unstructured":"B. Cao, C.H. Chang, T. Srikanthan, An efficient reverse converter for the 4-moduli set $$\\{2^{n}-1, 2^{n}, 2^{n}+1, 2^{2n}+1\\}$$ { 2 n - 1 , 2 n , 2 n + 1 , 2 2 n + 1 } based on Chinese New Remainder Theorem. IEEE Trans. Circuits Syst. I 50, 1296\u20131303 (2003)","journal-title":"IEEE Trans. Circuits Syst. I"},{"key":"9798_CR5","doi-asserted-by":"crossref","first-page":"1041","DOI":"10.1109\/TCSI.2007.890623","volume":"54","author":"B Cao","year":"2007","unstructured":"B. Cao, C.H. Chang, T. Srikanthan, A residue to binary converter for a new five-moduli set. IEEE Trans. Circuits Syst. I 54, 1041\u20131049 (2007)","journal-title":"IEEE Trans. Circuits Syst. I"},{"key":"9798_CR6","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1049\/ip-cdt:20045155","volume":"152","author":"B Cao","year":"2005","unstructured":"B. Cao, T. Srikanthan, C.H. Chang, Efficient reverse converters for the four-moduli sets $$\\{2^{n}-1, 2^{n}, 2^{n}+1, 2^{n+1}-1 {\\rm and} 2^{n}-1, 2^{n}, 2^{n}+1, 2^{n-1}-1\\}$$ { 2 n - 1 , 2 n , 2 n + 1 , 2 n + 1 - 1 and 2 n - 1 , 2 n , 2 n + 1 , 2 n - 1 - 1 } . Proc. IEEE Comput. Digit. Tech. 152, 687\u2013696 (2005)","journal-title":"Proc. IEEE Comput. Digit. Tech."},{"key":"9798_CR7","unstructured":"C.H. Chang, S. Menon, B. Cao, T.A. Srikanthan, A configurable dual moduli multi-operand modulo adder. Proceedings of the IEEE International Symposium on Circuits and System, 2005"},{"key":"9798_CR8","doi-asserted-by":"crossref","unstructured":"M. Ciet, M. Nevel, E. Peetersl, J.J. Quisquater, in Parallel FPGA implementation of RSA with residue number systems, Proceedings of the 46th IEEE International Midwest Symposium on Circuits Systems, vol. 2, 2003, pp. 806\u2013810","DOI":"10.1109\/MWSCAS.2003.1562409"},{"issue":"1","key":"9798_CR9","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1109\/TCSII.2003.821524","volume":"51","author":"R Conway","year":"2004","unstructured":"R. Conway, J. Nelson, Improved RNS FIR filter architectures. IEEE Trans. Circuits Syst. II 51(1), 26\u201328 (2004)","journal-title":"IEEE Trans. Circuits Syst. II"},{"key":"9798_CR10","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1109\/82.664260","volume":"45","author":"A Dhurkadas","year":"1998","unstructured":"A. Dhurkadas, Comments on a high speed realisation of a residue to binary number system converter. IEEE Trans. Circuits Syst. II 45, 446\u2013447 (1998)","journal-title":"IEEE Trans. Circuits Syst. II"},{"key":"9798_CR11","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1109\/12.863036","volume":"49","author":"L Kalampoukas","year":"2000","unstructured":"L. Kalampoukas, D. Nikolos, C. Efstathiou, H.T. Vergos, J. Kalamatianos, High-speed parallel-prefix modulo 2 $$^{n}$$ n -1 adders. IEEE Trans. Comput. 49, 673\u2013679 (2000)","journal-title":"IEEE Trans. Comput."},{"key":"9798_CR12","doi-asserted-by":"crossref","first-page":"2058","DOI":"10.1093\/ietisy\/e91-d.7.2058","volume":"E91\u2013D","author":"SH Lin","year":"2008","unstructured":"S.H. Lin, M.H. Sheu, C.H. Wang, Efficient VLSI design of residue-to-binary converter for the moduli set (2 $$^{n}, 2^{n+1} -1, 2^{n} -1$$ n , 2 n + 1 - 1 , 2 n - 1 ). IEICE Trans. E91\u2013D, 2058\u20132060 (2008)","journal-title":"IEICE Trans."},{"key":"9798_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0997-4","volume-title":"Residue Number Systems: Algorithms and Architectures","author":"PVA Mohan","year":"2002","unstructured":"P.V.A. Mohan, Residue Number Systems: Algorithms and Architectures (Kluwer, Norwell, 2002)"},{"issue":"9","key":"9798_CR14","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1109\/TCSII.2007.900844","volume":"54","author":"PVA Mohan","year":"2007","unstructured":"P.V.A. Mohan, RNS-to-binary converter for a new three-moduli set $$\\{2^{n+1} -1, 2^{n}, 2^{n} -1\\}$$ { 2 n + 1 - 1 , 2 n , 2 n - 1 } . IEEE Trans. Circuits Syst. II 54(9), 775\u2013779 (2007)","journal-title":"IEEE Trans. Circuits Syst. II"},{"key":"9798_CR15","first-page":"643","volume":"62","author":"PVA Mohan","year":"2008","unstructured":"P.V.A. Mohan, New reverse converters for the moduli set $$\\{2^{n} - 3, 2^{n}- 1, 2^{n}+1, 2^{n}+ 3\\}$$ { 2 n - 3 , 2 n - 1 , 2 n + 1 , 2 n + 3 } . J. Electron. Commun. 62, 643\u2013658 (2008)","journal-title":"J. Electron. Commun."},{"key":"9798_CR16","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1109\/TCSI.2007.895515","volume":"54","author":"PVA Mohan","year":"2007","unstructured":"P.V.A. Mohan, A.B. Premkumar, RNS-to-binary converters for two four-moduli set $$\\{2^{n}- 1, 2^{n}, 2^{n} + 1, 2^{n+1}- 1\\}$$ { 2 n - 1 , 2 n , 2 n + 1 , 2 n + 1 - 1 } and $$\\{2^{n} - 1, 2^{n}, 2^{n} + 1, 2^{n+1}+ 1\\}$$ { 2 n - 1 , 2 n , 2 n + 1 , 2 n + 1 + 1 } . IEEE Trans. Circuits Syst. I 54, 1245\u20131254 (2007)","journal-title":"IEEE Trans. Circuits Syst. I"},{"key":"9798_CR17","doi-asserted-by":"crossref","unstructured":"A.S. Molahosseini, K. Navi, A reverse converter for the enhanced moduli set $$\\{2^{n}-1, 2^{n} +1, 2^{2n}, 2^{2n+1} -1\\}$$ { 2 n - 1 , 2 n + 1 , 2 2 n , 2 2 n + 1 - 1 } using CRT and MRC. Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI\u201910), Kefalonia, Greece, 2010, pp. 456\u2013457","DOI":"10.1109\/ISVLSI.2010.105"},{"issue":"7","key":"9798_CR18","doi-asserted-by":"crossref","first-page":"1341","DOI":"10.1142\/S0218126611007906","volume":"20","author":"MR Noorimehr","year":"2011","unstructured":"M.R. Noorimehr, M. Hosseinzadeh, R. Farshidi, An efficient reverse converter for the new four moduli set $$\\{2^{2n}, 2^{n\/2} -1, 2^{n\/2} +1, 2^{n+1}-1\\}$$ { 2 2 n , 2 n \/ 2 - 1 , 2 n \/ 2 + 1 , 2 n + 1 - 1 } . J. Circuits Syst. 20(7), 1341\u20131355 (2011)","journal-title":"J. Circuits Syst."},{"key":"9798_CR19","first-page":"165","volume":"5","author":"MR Noorimehr","year":"2011","unstructured":"M.R. Noorimehr, M. Hosseinzadeh, H.R. Hosseini, A new four-moduli set $$\\{2^{2n}, 2^{n+1} -1, 2^{n\/2} +1, 2^{n\/2}-1\\}$$ { 2 2 n , 2 n + 1 - 1 , 2 n \/ 2 + 1 , 2 n \/ 2 - 1 } with an efficient residue to binary converter. J. Autom. Syst. Eng. 5, 165\u2013175 (2011)","journal-title":"J. Autom. Syst. Eng."},{"key":"9798_CR20","doi-asserted-by":"crossref","DOI":"10.1142\/p523","volume-title":"Residue Number Systems: Theory and Implementations","author":"A Omondi","year":"2007","unstructured":"A. Omondi, B. Premkumar, Residue Number Systems: Theory and Implementations (Imperial College Press, London, 2007)"},{"key":"9798_CR21","volume-title":"Computer Arithmetic: Algorithms and Hardware Design","author":"B Parhami","year":"2000","unstructured":"B. Parhami, Computer Arithmetic: Algorithms and Hardware Design (Oxford University Press, Oxford, 2000)"},{"issue":"4","key":"9798_CR22","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1109\/TC.2007.1001","volume":"56","author":"RA Patel","year":"2007","unstructured":"R.A. Patel, M. Benaissa, S. Boussakta, Fast modulo $$2^{n}-(2^{n-2}+1)$$ 2 n - ( 2 n - 2 + 1 ) addition: a new class of adder for RNS. IEEE Trans. Comput. 56(4), 572\u2013576 (2007)","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"9798_CR23","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/12.250610","volume":"423","author":"SJ Piestrak","year":"1994","unstructured":"S.J. Piestrak, Design of residue generators and multioperand modular adders using carry-save adders. IEEE Trans. Comput. 423(1), 68\u201377 (1994)","journal-title":"IEEE Trans. Comput."},{"issue":"10","key":"9798_CR24","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1109\/82.471401","volume":"42","author":"SJ Piestrak","year":"1995","unstructured":"S.J. Piestrak, A high speed realization of a residue to binary converter. IEEE Trans. Circuits Syst. II 42(10), 661\u2013663 (1995)","journal-title":"IEEE Trans. Circuits Syst. II"},{"key":"9798_CR25","volume-title":"Elementary Number Theory and Its Application","author":"KH Rosen","year":"1988","unstructured":"K.H. Rosen, Elementary Number Theory and Its Application (Addison-Wesley, Reading, 1988)"},{"issue":"2","key":"9798_CR26","doi-asserted-by":"crossref","first-page":"37","DOI":"10.4316\/aece.2011.02006","volume":"11","author":"A Sabbagh","year":"2011","unstructured":"A. Sabbagh, Improving the delay of residue-to-binary converter for a four-moduli set. Adv. Electr. Comput. Eng. 11(2), 37\u201342 (2011)","journal-title":"Adv. Electr. Comput. Eng."},{"issue":"6","key":"9798_CR27","first-page":"6167","volume":"2","author":"A Sabbagh","year":"2012","unstructured":"A. Sabbagh, S. Jafarali Jassbi, S. Sorouri, Design and FPGA implementation of an improved RNS conveter. J. Basic Appl. Sci. Res. 2(6), 6167\u20136171 (2012)","journal-title":"J. Basic Appl. Sci. Res."},{"issue":"9","key":"9798_CR28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TCSI.2009.2032047","volume":"56","author":"A Sabbagh","year":"2009","unstructured":"A. Sabbagh, K. Navi, Ch. Dadkhah, S. Timarchi, Efficient reverse converter designs for the new 4-moduli sets $$\\{2^{n}-1, 2^{n}, 2^{n} +1, 2^{2n+1}-1\\}$$ { 2 n - 1 , 2 n , 2 n + 1 , 2 2 n + 1 - 1 } and $$\\{2^{n}-1, 2^{n}+1, 2^{2n}, 2^{2n} +1\\}$$ { 2 n - 1 , 2 n + 1 , 2 2 n , 2 2 n + 1 } . IEEE Trans. Circuit Syst. 56(9), 1\u201313 (2009)","journal-title":"IEEE Trans. Circuit Syst."},{"key":"9798_CR29","first-page":"52","volume":"51","author":"MH Sheu","year":"2004","unstructured":"M.H. Sheu, S.H. Lin, C. Chen, S.W. Yang, An efficient VLSI design for a residue to binary converter for general balance moduli $$(2^{n}-3, 2^{n}-1, 2^{n}+1, 2^{n}+3)$$ ( 2 n - 3 , 2 n - 1 , 2 n + 1 , 2 n + 3 ) . IEEE Trans. Circuits Syst. 51, 52\u201355 (2004)","journal-title":"IEEE Trans. Circuits Syst."},{"key":"9798_CR30","volume-title":"Residue Number System Arithmetic: Modern Applications in Digital Signal Processing","author":"MA Soderstrand","year":"1986","unstructured":"M.A. Soderstrand, Residue Number System Arithmetic: Modern Applications in Digital Signal Processing (IEEE Press, Piscataway, 1986)"},{"issue":"1","key":"9798_CR31","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1109\/TCS.1986.1085824","volume":"33","author":"MA Soderstrand","year":"1986","unstructured":"M.A. Soderstrand, R.A. Escott, VLSI implementation in multiple-valued logic of an FIR digital filter using residue number system arithmetic. IEEE Trans. Circuits Syst. 33(1), 5\u201325 (1986)","journal-title":"IEEE Trans. Circuits Syst."},{"issue":"4","key":"9798_CR32","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1109\/TCSII.2012.2188456","volume":"59","author":"L Sousa","year":"2012","unstructured":"L. Sousa, S. Ant\u00e3o, MRC-based RNS reverse converters for the four-moduli sets $$\\}2^{n}+1, 2^{n}-1, 2^{n}, 2^{2n+1}-1\\}$$ } 2 n + 1 , 2 n - 1 , 2 n , 2 2 n + 1 - 1 } and $$\\{2^{n} +1, 2^{n}-1,2^{2n}, 2^{2n+1} -1\\}$$ { 2 n + 1 , 2 n - 1 , 2 2 n , 2 2 n + 1 - 1 } . IEEE Trans. Circuits Syst. 59(4), 244\u2013248 (2012)","journal-title":"IEEE Trans. Circuits Syst."},{"issue":"5","key":"9798_CR33","doi-asserted-by":"crossref","first-page":"1302","DOI":"10.1109\/TASSP.1985.1164692","volume":"33","author":"F Taylor","year":"1985","unstructured":"F. Taylor, A single modulus ALU for signal processing. IEEE Trans. Acoust. Speech Signal Process. 33(5), 1302\u20131315 (1985)","journal-title":"IEEE Trans. Acoust. Speech Signal Process."},{"key":"9798_CR34","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1109\/MC.1984.1659138","volume":"17","author":"FJ Taylor","year":"1984","unstructured":"F.J. Taylor, Residue arithmetic: a tutorial with examples. IEEE Comput. 17, 50\u201362 (1984)","journal-title":"IEEE Comput."},{"key":"9798_CR35","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1142\/S0218126600000044","volume":"10","author":"AP Vinod","year":"2000","unstructured":"A.P. Vinod, A.B. Premkumar, A residue to binary converter for the 4-moduli superset $$\\{2^{n}-1, 2^{n}, 2^{n}+1, 2^{n+1}-1\\}$$ { 2 n - 1 , 2 n , 2 n + 1 , 2 n + 1 - 1 } . J. Circuits Syst. 10, 85\u201399 (2000)","journal-title":"J. Circuits Syst."},{"key":"9798_CR36","unstructured":"W. Wang, M.N.S. Swamy, M.O. Ahmad, Moduli selection in RNS for efficient VLSI implementation. Proceedings of the IEEE International Symposium on Circuits Systems, 2003, pp. 25\u201328"},{"key":"9798_CR37","doi-asserted-by":"crossref","unstructured":"W. Wang, 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, 2004, pp. 77\u201380","DOI":"10.1109\/IWSOC.2004.1319854"},{"issue":"3","key":"9798_CR38","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1109\/82.826745","volume":"47","author":"Y Wang","year":"2000","unstructured":"Y. Wang, Residue-to-binary converters based on new chinese remainder theorems. IEEE Trans. Circuits Syst. 47(3), 197\u2013205 (2000)","journal-title":"IEEE Trans. Circuits Syst."},{"issue":"7","key":"9798_CR39","doi-asserted-by":"crossref","first-page":"1772","DOI":"10.1109\/TSP.2002.1011216","volume":"50","author":"Y Wang","year":"2002","unstructured":"Y. Wang, X. Song, M. Aboulhamid, H. Shen, Adder based residue to binary numbers converters for $$\\{2^{n}-1, 2^{n}, 2^{n}+1\\}$$ { 2 n - 1 , 2 n , 2 n + 1 } . IEEE Trans. Signal Process. 50(7), 1772\u20131779 (2002)","journal-title":"IEEE Trans. Signal Process."},{"key":"9798_CR40","doi-asserted-by":"crossref","unstructured":"R. Zimmermann, Efficient VLSI implementation of modulo ( $$2^{n} \\pm 1$$ 2 n \u00b1 1 ) addition and multiplication. Proceedings of the 14th IEEE Symposium on Computer Arithmetic, Adelaide, 1999, 158\u2013167","DOI":"10.1109\/ARITH.1999.762841"}],"container-title":["Circuits, Systems, and Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00034-014-9798-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00034-014-9798-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00034-014-9798-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T15:42:11Z","timestamp":1746200531000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00034-014-9798-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,29]]},"references-count":40,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["9798"],"URL":"https:\/\/doi.org\/10.1007\/s00034-014-9798-1","relation":{},"ISSN":["0278-081X","1531-5878"],"issn-type":[{"type":"print","value":"0278-081X"},{"type":"electronic","value":"1531-5878"}],"subject":[],"published":{"date-parts":[[2014,4,29]]}}}