{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T16:07:58Z","timestamp":1761581278864,"version":"3.37.3"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2015,12,1]],"date-time":"2015-12-01T00:00:00Z","timestamp":1448928000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia (FCT)","award":["UID\/CEC\/50021\/2013","EXPL\/EEI-ELC\/1572\/2013"],"award-info":[{"award-number":["UID\/CEC\/50021\/2013","EXPL\/EEI-ELC\/1572\/2013"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2015,12,1]]},"DOI":"10.1109\/tc.2015.2401026","type":"journal-article","created":{"date-parts":[[2015,2,6]],"date-time":"2015-02-06T15:01:36Z","timestamp":1423234896000},"page":"3322-3334","source":"Crossref","is-referenced-by-count":24,"title":["&lt;inline-formula&gt;&lt;tex-math&gt;$2^n$&lt;\/tex-math&gt;&lt;alternatives&gt; &lt;inline-graphic xlink:type=\"simple\" xlink:href=\"sousa-ieq1-2401026.gif\"\/&gt;&lt;\/alternatives&gt;&lt;\/inline-formula&gt; RNS Scalers for Extended 4-Moduli Sets"],"prefix":"10.1109","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8066-221X","authenticated-orcid":false,"given":"Leonel","family":"Sousa","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2002.1146705"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICECS.2005.4633502"},{"key":"ref31","first-page":"158","article-title":"Efficient VLSI implementation of modulo $2^n \\pm 1$ addition and multiplication","author":"zimmermann","year":"0","journal-title":"Proc 14th IEEE Symp Computer Arithmetic (ARITH '99)"},{"year":"0","key":"ref30"},{"key":"ref34","article-title":"Arithmetic-based binary-to-RNs converter modulo $2^n \\pm k$ for jn-bit dynamic range","author":"matutino","year":"0","journal-title":"IEEE Trans Very Large Scale Integration Syst"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ASSP.1989.28063"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/78.469842"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/12.780883"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2008.2004550"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-010-0015-y"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2011.2142950"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2012.2221752"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2012.2206491"},{"key":"ref18","first-page":"821","article-title":"High-speed and reduced-area RNS forward converter based on ($2^n -1, 2^n, 2^n +1$ ) moduli set","volume":"2","author":"sheu","year":"0","journal-title":"Proc IEEE Asia-Pacific Conf Circuits Syst"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2002.1011216"},{"key":"ref28","first-page":"139","article-title":"A new balanced 4-moduli set $\\lbrace 2^k, 2^n - 1, 2^n + 1, 2^{n+1}-1\\rbrace$ and its reverse converter design for efficient FIR filter implementation","author":"chalivendra","year":"0","journal-title":"Proc 21st Edition Great Lakes Symp VLSI"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/AERO.2003.1235253"},{"key":"ref27","first-page":"437","article-title":"Efficient VLSI design of a reverse RNS converter for new flexible 4-moduli set $(2^{p+k}, 2^p+1, 2^p-1, 2^{2p}+1)$","author":"kuo","year":"0","journal-title":"Proc IEEE Int Symp Circuits Syst"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2012.2210916"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1109\/TCSII.2003.821524","article-title":"Improved RNS FIR filter architectures","volume":"51","author":"nelson","year":"2004","journal-title":"IEEE Trans Circuits Syst II Express Briefs"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2014.6865614"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2007.378155"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.1989.266618"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.1988.754020"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2400682.2400692"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/78.655432"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0997-4"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/82.559370"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2007.895515"},{"key":"ref21","first-page":"210","article-title":"$\\lbrace 2^n + 1, 2^{n+k}, 2^n - 1\\rbrace$ : A new RNS moduli set extension","author":"chaves","year":"0","journal-title":"Proc Euromicro Symp Digital Syst Des"},{"key":"ref24","first-page":"2103","article-title":"An improved RNS reverse converter for the $\\lbrace 2^{2n+1}-1, 2^n, 2^n-1\\rbrace$ moduli set","author":"gbolagade","year":"0","journal-title":"Proc IEEE Int Symp Circuits Syst"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2012.2219564"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2012.2188456"},{"key":"ref25","first-page":"456","article-title":"A reverse converter for the enhanced moduli set $\\lbrace 2^n-1, 2^n+1, 2^{2n}, 2^{2n+1}-1\\rbrace$ using CRT and MRC","author":"molahosseini","year":"0","journal-title":"Proc IEEE Comput Soc Annu Symp VLSI"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/12\/7313054\/07034999.pdf?arnumber=7034999","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:45:50Z","timestamp":1641987950000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7034999\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,1]]},"references-count":34,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tc.2015.2401026","relation":{},"ISSN":["0018-9340"],"issn-type":[{"type":"print","value":"0018-9340"}],"subject":[],"published":{"date-parts":[[2015,12,1]]}}}