{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T22:26:46Z","timestamp":1757456806230,"version":"3.41.0"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2017,12,5]],"date-time":"2017-12-05T00:00:00Z","timestamp":1512432000000},"content-version":"unspecified","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":[[2018,8]]},"DOI":"10.1007\/s00034-017-0725-0","type":"journal-article","created":{"date-parts":[[2017,12,5]],"date-time":"2017-12-05T17:57:14Z","timestamp":1512496634000},"page":"3605-3634","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Reverse Converters for the Moduli Set { $$2^{n}, 2^{n-1}-1,2^{n}-1, 2^{n+1}-1\\}(n\\,\\hbox {Even})$$ 2 n , 2 n - 1 - 1 , 2 n - 1 , 2 n + 1 - 1 } ( n Even )"],"prefix":"10.1007","volume":"37","author":[{"given":"P. V.","family":"Ananda Mohan","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,5]]},"reference":[{"key":"725_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0997-4","volume-title":"Residue Number Systems: Algorithms and Architectures","author":"PV Ananda Mohan","year":"2002","unstructured":"P.V. Ananda Mohan, Residue Number Systems: Algorithms and Architectures (Kluwer Academic Publishers, New York, 2002)"},{"issue":"9","key":"725_CR2","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1109\/TCSII.2007.900844","volume":"54","author":"PV Ananda Mohan","year":"2007","unstructured":"P.V. Ananda Mohan, RNS to binary converter for the 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 Express Brief 54(9), 775\u2013779 (2007)","journal-title":"IEEE Trans. Circuits Syst. II Express Brief"},{"key":"725_CR3","first-page":"643","volume":"62","author":"PV Ananda Mohan","year":"2008","unstructured":"P.V. Ananda 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 . AEU 62, 643\u2013658 (2008)","journal-title":"AEU"},{"key":"725_CR4","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1109\/TCSI.2007.895515","volume":"54","author":"PV Ananda Mohan","year":"2007","unstructured":"P.V. Ananda Mohan, A.B. Premkumar, RNS to Binary converters for two four moduli sets $$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":"725_CR5","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 , in IEEE Conference on Computer Arithmetic (1999), pp. 168\u2013175"},{"key":"725_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$$ 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 . IEE Proc. Comput. Digit. Tech. 152, 687\u2013696 (2005)","journal-title":"IEE Proc. Comput. Digit. Tech."},{"key":"725_CR7","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 the new Chinese remainder theorem. IEEE Trans. Circuits Syst. I 50, 1296\u20131303 (2003)","journal-title":"IEEE Trans. Circuits Syst. I"},{"key":"725_CR8","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":"725_CR9","doi-asserted-by":"crossref","unstructured":"G. Chalivendra, V. Hanumaiah, S. Vrudhula, A new balanced 4-moduli set $$2^{k}, 2^{n}-1, 2^{n}+1, 2^{n+1}-1$$ 2 k , 2 n - 1 , 2 n + 1 , 2 n + 1 - 1 and its reverse converter design for efficient reverse converter implementation, in Proceedings of ACM GSVLSI, (Lausanne, Switzerland, 2011), pp. 139\u2013144","DOI":"10.1145\/1973009.1973038"},{"issue":"3","key":"725_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 realization of a residue to binary number system converter. IEEE Trans. Circuits Syst. II Analog. Digit. Signal Process. 45(3), 446\u2013447 (1998)","journal-title":"IEEE Trans. Circuits Syst. II Analog. Digit. Signal Process."},{"key":"725_CR11","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1109\/TCSII.2008.2010157","volume":"56","author":"LS Didier","year":"2009","unstructured":"L.S. Didier, P.Y. Rivaille, A generalization of a fast RNS conversion for a new 4-modulus base. IEEE Trans. Circuits Syst. II Express Br. 56, 46\u201350 (2009)","journal-title":"IEEE Trans. Circuits Syst. II Express Br."},{"issue":"1","key":"725_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1587\/elex.9.1","volume":"9","author":"M Esmaeildoust","year":"2012","unstructured":"M. Esmaeildoust, K. Navi, M. Taheri, A.S. Molahosseini, S. Khodambashi, Efficient RNS to binary converters for the new 4-moduli set $$2^{n}, 2^{n+1} -1, 2^{n}-1, 2^{n-1} -1$$ 2 n , 2 n + 1 - 1 , 2 n - 1 , 2 n - 1 - 1 . IEICE Electron. Express 9(1), 1\u20137 (2012)","journal-title":"IEICE Electron. Express"},{"key":"725_CR13","doi-asserted-by":"crossref","first-page":"1545","DOI":"10.1109\/TVLSI.2012.2210916","volume":"21","author":"M Esmaeildoust","year":"2013","unstructured":"M. Esmaeildoust, D. Schinianakis, H. Javashi, T. Stouraitis, K. Navi, Efficient RNS implementation of elliptic curve point multiplication over GF( $$p)$$ p ) . IEEE Trans. VLSI Syst. 21, 1545\u20131549 (2013)","journal-title":"IEEE Trans. VLSI Syst."},{"key":"725_CR14","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1109\/TVLSI.2004.840400","volume":"13","author":"AA Hiasat","year":"2005","unstructured":"A.A. Hiasat, VLSI implementation of new arithmetic residue to binary decoders. IEEE Trans. Very Large Scale Integr. (VLSI) Syst. 13, 153\u2013158 (2005)","journal-title":"IEEE Trans. Very Large Scale Integr. (VLSI) Syst."},{"key":"725_CR15","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1587\/elex.5.672","volume":"5","author":"M Hosseinzadeh","year":"2008","unstructured":"M. Hosseinzadeh, A. Molahosseini, K. Navi, An improved reverse converter for the moduli set $$2^{n}+1, 2^{n}-1, 2^{n}, 2^{n+1}-1$$ 2 n + 1 , 2 n - 1 , 2 n , 2 n + 1 - 1 . IEICE Electron. Express 5, 672\u2013677 (2008)","journal-title":"IEICE Electron. Express"},{"key":"725_CR16","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1049\/iet-cdt.2012.0148","volume":"8","author":"G Jaberipur","year":"2014","unstructured":"G. Jaberipur, H. Ahmadifar, A ROM-less reverse converter for moduli set $$2^{q}\\pm 1, 2^{q}\\pm 3$$ 2 q \u00b1 1 , 2 q \u00b1 3 . IET Comput. Digit. Tech. 8, 11\u201322 (2014)","journal-title":"IET Comput. Digit. Tech."},{"key":"725_CR17","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1109\/TCSI.2009.2026681","volume":"57","author":"AS Molahosseini","year":"2010","unstructured":"A.S. Molahosseini, K. Navi, C. Dadkhah, O. Kavehei, 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 based on new CRTs. IEEE Trans. Circuits Syst. I 57, 823\u2013835 (2010)","journal-title":"IEEE Trans. Circuits Syst. I"},{"key":"725_CR18","doi-asserted-by":"crossref","DOI":"10.1142\/p523","volume-title":"Residue Number Systems: Theory and Implementation","author":"A Omondi","year":"2007","unstructured":"A. Omondi, B. Premkumar, Residue Number Systems: Theory and Implementation (Imperial College Press, London, 2007)"},{"key":"725_CR19","doi-asserted-by":"crossref","first-page":"3436","DOI":"10.1109\/TCSI.2014.2337237","volume":"61","author":"P Patronik","year":"2014","unstructured":"P. Patronik, S.J. Piestrak, Design of reverse converters for the new RNS 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 ( $$n$$ n odd). IEEE Trans. Circuits Syst. I 61, 3436\u20133449 (2014)","journal-title":"IEEE Trans. Circuits Syst. I"},{"key":"725_CR20","doi-asserted-by":"crossref","first-page":"1687","DOI":"10.1109\/TCSI.2013.2290843","volume":"61","author":"P Patronik","year":"2014","unstructured":"P. Patronik, S.J. Piestrak, Design of reverse converters for general RNS moduli sets $$2^{k}, 2^{n}-1, 2^{n}+1, 2^{n+1}-1$$ 2 k , 2 n - 1 , 2 n + 1 , 2 n + 1 - 1 and $$2^{k}, 2^{n}-1, 2^{n}+1, 2^{n-1}-1$$ 2 k , 2 n - 1 , 2 n + 1 , 2 n - 1 - 1 ( $$n$$ n even). IEEE Trans. Circuits Syst. I 61, 1687\u20131700 (2014)","journal-title":"IEEE Trans. Circuits Syst. I"},{"key":"725_CR21","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1109\/TCSII.2013.2286433","volume":"60","author":"H Pettenghi","year":"2013","unstructured":"H. Pettenghi, R. Chaves, L. Sousa, Method to design general RNS converters for extended moduli sets. IEEE Trans. Circuits Syst. II 60, 877\u2013881 (2013)","journal-title":"IEEE Trans. Circuits Syst. II"},{"key":"725_CR22","doi-asserted-by":"crossref","first-page":"1487","DOI":"10.1109\/TCSI.2012.2220460","volume":"60","author":"H Pettenghi","year":"2013","unstructured":"H. Pettenghi, R. Chaves, L. Sousa, RNS reverse converters for moduli sets with dynamic ranges up to (8 $$n$$ n +1) bits. IEEE Trans. Circuits Syst. 60, 1487\u20131500 (2013)","journal-title":"IEEE Trans. Circuits Syst."},{"issue":"10","key":"725_CR23","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 residue to binary system converter. IEEE Trans. Circuits Syst. II Analog. Digit. Signal Process. 42(10), 661\u2013663 (1995)","journal-title":"IEEE Trans. Circuits Syst. II Analog. Digit. Signal Process."},{"key":"725_CR24","doi-asserted-by":"crossref","unstructured":"A. Skavantzos, T. Stouraitis, Grouped-moduli residue number systems for fast signal processing, in Proceedings of IEEE ISCAS (1999), pp. 478\u2013483","DOI":"10.1109\/ISCAS.1999.778887"},{"key":"725_CR25","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1109\/78.747787","volume":"47","author":"A Skavantzos","year":"1999","unstructured":"A. Skavantzos, M. Abdallah, Implementation issues of the two-level residue number system with pairs of conjugate moduli. IEEE Trans. Signal Process. 47, 826\u2013838 (1999)","journal-title":"IEEE Trans. Signal Process."},{"key":"725_CR26","doi-asserted-by":"crossref","unstructured":"A. Skavantzos, M. Abdallah, T. Stouraitis, D. Schinianakis, Design of a balanced 8-modulus RNS, in Proceedings of IEEE ISCAS (2009), pp. 61\u201364","DOI":"10.1109\/ICECS.2009.5410923"},{"key":"725_CR27","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. Express Br. 51, 52\u201355 (2004)","journal-title":"IEEE Trans. Circuits Syst. Express Br."},{"key":"725_CR28","volume-title":"Residue Number System Arithmetic: Modern Applications in Signal Processing","author":"MA Soderstrand","year":"1986","unstructured":"M.A. Soderstrand, W.K. Jenkins, G.A. Jullien, F.J. Taylor, Residue Number System Arithmetic: Modern Applications in Signal Processing (IEEE Press, New York, 1986)"},{"key":"725_CR29","doi-asserted-by":"crossref","first-page":"1945","DOI":"10.1109\/TVLSI.2012.2219564","volume":"21","author":"L Sousa","year":"2013","unstructured":"L. Sousa, S. Antao, R. Chaves, On the design of RNS reverse converters for the four-moduli set $$2^{n}+1, 2^{n}-1, 2^{n}, 2^{n+1}+1$$ 2 n + 1 , 2 n - 1 , 2 n , 2 n + 1 + 1 . IEEE Trans. VLSI Syst. 21, 1945\u20131949 (2013)","journal-title":"IEEE Trans. VLSI Syst."},{"key":"725_CR30","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1109\/TCSII.2012.2188456","volume":"59","author":"L Sousa","year":"2012","unstructured":"L. Sousa, S. Antao, 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. II 59, 244\u2013248 (2012)","journal-title":"IEEE Trans. Circuits Syst. II"},{"key":"725_CR31","first-page":"91","volume":"24","author":"N Stamenkovic","year":"2011","unstructured":"N. Stamenkovic, B. Jovanovic, Reverse converter design for the 4-moduli set $$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 based on the mixed-radix conversion. Facta Univ. (NIS) Ser. Electron. Energ. 24, 91\u2013105 (2011)","journal-title":"Facta Univ. (NIS) Ser. Electron. Energ."},{"key":"725_CR32","volume-title":"Residue Arithmetic and Its Applications to Computer Technology","author":"NS Szabo","year":"1967","unstructured":"N.S. Szabo, R.I. Tanaka, Residue Arithmetic and Its Applications to Computer Technology (Mc-Graw Hill, New York, 1967)"},{"key":"725_CR33","first-page":"43","volume":"2","author":"MR Taheri","year":"2015","unstructured":"M.R. Taheri, N. Shafiee, M. Esmaeildoust, Z. Amirjamshidi, R. Sabbaghi-nadooshan, K. Navi, A high speed residue-to-binary converter for balanced 4-moduli set. J. Comput. Secur. 2, 43\u201354 (2015)","journal-title":"J. Comput. Secur."},{"key":"725_CR34","doi-asserted-by":"crossref","first-page":"1163","DOI":"10.1109\/12.257703","volume":"42","author":"A Tyagi","year":"1993","unstructured":"A. Tyagi, A reduced-area scheme for carry-select adders. IEEE Trans. Comput. 42, 1163\u20131170 (1993)","journal-title":"IEEE Trans. Comput."},{"key":"725_CR35","first-page":"85","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 . JCSC 10, 85\u201399 (2000)","journal-title":"JCSC"},{"issue":"7","key":"725_CR36","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 number converters for $$2^{n+}1 -1, 2^{n}, 2^{n}-1$$ 2 n + 1 - 1 , 2 n , 2 n - 1 . IEEE Trans. Signal Process. 50(7), 1772\u20131779 (2002)","journal-title":"IEEE Trans. Signal Process."},{"key":"725_CR37","doi-asserted-by":"crossref","first-page":"1437","DOI":"10.1109\/81.883343","volume":"47","author":"Z Wang","year":"2000","unstructured":"Z. Wang, G.A. Jullien, W.C. Miller, An improved residue to binary converter. IEEE Trans. Circuits Syst. I 47, 1437\u20131440 (2000)","journal-title":"IEEE Trans. Circuits Syst. I"},{"key":"725_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. II 47, 197\u2013205 (2000)","journal-title":"IEEE Trans. Circuits Syst. II"},{"key":"725_CR39","doi-asserted-by":"crossref","unstructured":"M. Wesolowski, P. Patronik, K. Berezowski, J. Biernat, Design of a novel flexible 4-moduli RNS and reverse converter, in Proceedings of Signals and Systems Conference (IS SC 2012), IET Irish, IET (2012), pp 1\u20136","DOI":"10.1049\/ic.2012.0199"},{"key":"725_CR40","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1016\/j.ins.2007.05.040","volume":"178","author":"W Zhang","year":"2008","unstructured":"W. Zhang, P. Siy, An efficient design of residue to binary converter for the moduli set $$2^{n}-1, 2^{n}+1, 2^{2n}-2, 2^{2n+1}-3$$ 2 n - 1 , 2 n + 1 , 2 2 n - 2 , 2 2 n + 1 - 3 based on new CRT II. Elsevier J. Inf. Sci. 178, 264\u2013279 (2008)","journal-title":"Elsevier J. Inf. Sci."}],"container-title":["Circuits, Systems, and Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00034-017-0725-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00034-017-0725-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00034-017-0725-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T03:35:02Z","timestamp":1751081702000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00034-017-0725-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,5]]},"references-count":40,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["725"],"URL":"https:\/\/doi.org\/10.1007\/s00034-017-0725-0","relation":{},"ISSN":["0278-081X","1531-5878"],"issn-type":[{"type":"print","value":"0278-081X"},{"type":"electronic","value":"1531-5878"}],"subject":[],"published":{"date-parts":[[2017,12,5]]}}}