{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T16:12:20Z","timestamp":1761581540556,"version":"3.37.3"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2017,7,1]],"date-time":"2017-07-01T00:00:00Z","timestamp":1498867200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. VLSI Syst."],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1109\/tvlsi.2017.2681758","type":"journal-article","created":{"date-parts":[[2017,3,28]],"date-time":"2017-03-28T19:55:46Z","timestamp":1490730946000},"page":"2188-2192","source":"Crossref","is-referenced-by-count":18,"title":["A Residue-to-Binary Converter for the Extended Four-Moduli Set $\\{2^{n}-1, 2^{n}+1, 2^{2n}+1, 2^{2n+p}\\} $"],"prefix":"10.1109","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4785-3698","authenticated-orcid":false,"given":"Ahmad","family":"Hiasat","sequence":"first","affiliation":[]}],"member":"263","reference":[{"article-title":"ASIC and FPGA implementations of modern 4-moduli RNS reverse converters using distinct configurations","year":"2015","author":"zarandi","key":"ref30"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2007.895515"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2012.2219564"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2013.2290843"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2014.2337237"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"1296","DOI":"10.1109\/TCSI.2003.817789","article-title":"An efficient reverse converter for the 4-moduli set { $2^{n} - 1, 2^{n}, 2^{n} + 1, 2^{2n} + 1$ } based on the new Chinese remainder theorem","volume":"50","author":"cao","year":"2003","journal-title":"IEEE Trans Circuits Syst I Fundam Theory Appl"},{"key":"ref15","first-page":"437","article-title":"Efficient VLSI design of a reverse RNS converter for new flexible 4-moduli set $(2^{\\mathrm{ p+k}}, 2^{\\mathrm{ p}}+1, 2^{\\mathrm{ p}}-1, 2^{\\mathrm{ 2p}}+1)$","author":"kuo","year":"2009","journal-title":"Proc IEEE Int Symp Circuits Syst (ISCAS)"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2009.2026681"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E96.A.1571"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2012.2188456"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2004.840400"},{"key":"ref28","first-page":"165","article-title":"New Chinese remainder theorems","volume":"1","author":"wang","year":"1998","journal-title":"Proc 32nd Asilomar Conf Signals Syst Comput"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2012.2210916"},{"key":"ref27","first-page":"795","article-title":"RNS arithmetic units for modulo { $2^{n} \\pm k$ }","author":"matutino","year":"2012","journal-title":"Proc Euromicro Conf Digit Syst Design"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.5121\/vlsic.2012.3515"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ASAP.2010.5541000"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/12.863036"},{"key":"ref5","first-page":"1","article-title":"Efficient RNS bases for cryptography","author":"bajard","year":"2005","journal-title":"Proc 17th IMACS World Congr Sci Comput Appl Math Simulation"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1109\/ARITH.1999.762841","article-title":"Efficient VLSI implementation of modulo $(2^{n} \\pm 1)$ addition and multiplication","author":"zimmermann","year":"1999","journal-title":"Proc 14th IEEE Symp Comput Arithmetic"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2002.808191"},{"journal-title":"Residue Number System Arithmetic Modern Applications in Digital Signal Processing","year":"1986","author":"soderstrand","key":"ref2"},{"key":"ref9","first-page":"210","article-title":"$\\{2^{n} + 1, 2^{n+k}, 2^{n}-1\\}$ : A new RNS moduli set extension","author":"sousa","year":"2004","journal-title":"Proc Euromicro Symp Digital System Design (DSD)"},{"journal-title":"Residue Arithmetic and its Applications to Computer Technology","year":"1967","author":"szab\u00f3","key":"ref1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2007.890623"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2012.2220460"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxu084"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2013.2286433"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2016.2612723"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/47.1.93"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2016.2577609"}],"container-title":["IEEE Transactions on Very Large Scale Integration (VLSI) Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/92\/7956364\/07888595.pdf?arnumber=7888595","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T17:00:01Z","timestamp":1642006801000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7888595\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7]]},"references-count":30,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tvlsi.2017.2681758","relation":{},"ISSN":["1063-8210","1557-9999"],"issn-type":[{"type":"print","value":"1063-8210"},{"type":"electronic","value":"1557-9999"}],"subject":[],"published":{"date-parts":[[2017,7]]}}}