{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T15:01:53Z","timestamp":1775055713223,"version":"3.50.1"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2014,6,1]],"date-time":"2014-06-01T00:00:00Z","timestamp":1401580800000},"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. Circuits Syst. I"],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1109\/tcsi.2013.2290843","type":"journal-article","created":{"date-parts":[[2014,1,31]],"date-time":"2014-01-31T17:41:04Z","timestamp":1391190064000},"page":"1687-1700","source":"Crossref","is-referenced-by-count":30,"title":["Design of Reverse Converters for General RNS Moduli Sets &lt;formula formulatype=\"inline\"&gt;&lt;tex Notation=\"TeX\"&gt;$\\{ 2^{k}, 2^{n}-1, 2^{n}+1, 2^{n+1}-1 \\}$&lt;\/tex&gt;&lt;\/formula&gt; and &lt;formula formulatype=\"inline\"&gt; &lt;tex Notation=\"TeX\"&gt;$\\{ 2^{k}, 2^{n}-1, 2^{n}+1, 2^{n-1}-1 \\}$&lt;\/tex&gt;&lt;\/formula&gt; (&lt;formula formulatype=\"inline\"&gt;&lt;tex Notation=\"TeX\"&gt;$n$&lt;\/tex&gt;&lt;\/formula&gt; even)"],"prefix":"10.1109","volume":"61","author":[{"given":"Piotr","family":"Patronik","sequence":"first","affiliation":[]},{"given":"Stanislaw J.","family":"Piestrak","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","author":"voronenko","year":"2009","journal-title":"Multiplier Block Generator"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/1240233.1240234"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1142\/S0218126607003666"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2206781.2206799"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2007.890623"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/GLSV.1998.665223"},{"key":"ref37","first-page":"139","article-title":"A new balanced 4-moduli set <formula formulatype=\"inline\"><tex Notation=\"TeX\">$\\{ 2^{k}, 2^{n} - 1, 2^{n} + 1, 2^{n+1}-1 \\}$<\/tex><\/formula> and its reverse converter design for efficient FIR filter implementation","author":"chalivendra","year":"2011","journal-title":"Proc ACM GLSVLSI"},{"key":"ref36","first-page":"190","article-title":"Residue-to-binary arithmetic converter for moduli set <formula formulatype=\"inline\"><tex Notation=\"TeX\">$\\{ 2^{n} - 1, 2^{n}, 2^{n} + 1, 2^{n+1}-1 \\}$<\/tex><\/formula>","author":"mathew","year":"1999","journal-title":"Proc IEEE-EURASIP Workshop NSIP"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/78.747787"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2008.2010157"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"1211","DOI":"10.1109\/TC.2004.60","article-title":"Fast parallel-prefix modulo <formula formulatype=\"inline\"><tex Notation=\"TeX\">$2^{n}+1$<\/tex><\/formula> adders","volume":"53","author":"efstathiou","year":"2004","journal-title":"IEEE Trans Comput"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2007.903212"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2010.2040302"},{"key":"ref12","first-page":"57","article-title":"Unified approach to the design of modulo-<formula formulatype=\"inline\"><tex Notation=\"TeX\">$(2^{n} \\pm 1)$<\/tex> <\/formula> adders based on signed-LSB representation of residues","author":"jaberipur","year":"2009","journal-title":"Proc IEEE Symp Comput Arithm"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1109\/ARITH.1999.762841","article-title":"Efficient VLSI implementation of modulo <formula formulatype=\"inline\"><tex Notation=\"TeX\">$2^{n} \\pm 1$<\/tex> <\/formula> addition and multiplication","author":"zimmerman","year":"1999","journal-title":"Proc IEEE Symp Comput Arithm"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2004.1261842"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2009.2015548"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2003.821524"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1049\/cp:20080650","article-title":"Architecture of efficient RNS-based digital signal processor with very low-level pipelining","author":"piestrak","year":"2008","journal-title":"IET Irish Signals and Systems Conference (ISSC 2008) ISSC"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1049\/cp:20080692","article-title":"Design of residue multipliers-accumulators using periodicity","author":"piestrak","year":"2008","journal-title":"IET Irish Signals and Systems Conference (ISSC 2008) ISSC"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/82.471401"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1109\/TCSI.2007.895515","article-title":"RNS-to-binary converters for two four-moduli sets <formula formulatype=\"inline\"><tex Notation=\"TeX\">$\\{2^{n} - 1, 2^{n}, 2^{n} + 1, 2^{n+1}- 1 \\}$<\/tex><\/formula> and <formula formulatype=\"inline\"> <tex Notation=\"TeX\">$\\{2^{n} -1, 2^{n}, 2^{n} + 1, 2^{n+1}+1\\}$<\/tex><\/formula>","volume":"54","author":"ananda mohan","year":"2007","journal-title":"IEEE Trans Circuits Syst I"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1142\/S0218126603000878"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1049\/ip-cdt:20045155","article-title":"Efficient reverse converters for the four-moduli sets <formula formulatype=\"inline\"><tex Notation=\"TeX\">$\\{ 2^{n}, 2^{n}-1, 2^{n}+1, 2^{n+1}-1 \\}$<\/tex><\/formula> and <formula formulatype=\"inline\"> <tex Notation=\"TeX\">$\\{ 2^{n}, 2^{n}-1, 2^{n}+1, 2^{n-1}-1 \\}$<\/tex><\/formula>","volume":"152","author":"cao","year":"2005","journal-title":"IEE Proc -Comput Digit Tech"},{"key":"ref3","doi-asserted-by":"crossref","DOI":"10.1142\/p523","author":"omondi","year":"2007","journal-title":"Residue Number Systems Theory and Implementation"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/12.250610"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2012.2219564"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10617-005-1186-4"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2007.70750"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2011.5937843"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0997-4"},{"key":"ref9","first-page":"16","article-title":"Parallel prefix Ling structures for modulo <formula formulatype=\"inline\"><tex Notation=\"TeX\">$2^{n}-1$<\/tex><\/formula> addition","author":"chen","year":"2009","journal-title":"Proc IEEE Int Conf Appl -Specific Syst Arch & Processors"},{"key":"ref1","author":"soderstrand","year":"1986","journal-title":"Residue Number System Arithmetic Modern Applications in Digital Signal Processing"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/82.664260"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"1772","DOI":"10.1109\/TSP.2002.1011216","article-title":"Adder based residue to binary number converters for <formula formulatype=\"inline\"><tex Notation=\"TeX\">$(2^{n}-1, 2^{n}, 2^{n}+1)$<\/tex> <\/formula>","volume":"50","author":"wang","year":"2002","journal-title":"IEEE Trans Signal Process"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/81.883337"},{"key":"ref42","author":"hwang","year":"1979","journal-title":"Computer Arithmetic Principles Architecture and Design"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.1999.778887"},{"key":"ref41","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1049\/el:19960348","article-title":"asymptotic upper bound for multiplier design","volume":"32","author":"pinch","year":"1996","journal-title":"Electronics Letters"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1049\/iet-cdt:20060059"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1142\/S0218126600000044","article-title":"A memoryless reverse converter for the 4-moduli superset <formula formulatype=\"inline\"><tex Notation=\"TeX\">$\\{ 2^{n} - 1, 2^{n}, 2^{n} + 1, 2^{n+1}-1 \\}$<\/tex><\/formula>","volume":"10","author":"vinod","year":"2000","journal-title":"J Circuits Syst Comput"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1109\/ARITH.1999.762842","article-title":"Reverse converter for the 4-moduli superset <formula formulatype=\"inline\"><tex Notation=\"TeX\">$\\{ 2^{n} - 1, 2^{n}, 2^{n} + 1, 2^{n+1}-1 \\}$<\/tex><\/formula>","author":"bhardwaj","year":"1999","journal-title":"Proc 10th IEEE Symp Comput Arith"}],"container-title":["IEEE Transactions on Circuits and Systems I: Regular Papers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8919\/6820808\/06728709.pdf?arnumber=6728709","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:18:18Z","timestamp":1642004298000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6728709\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":42,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tcsi.2013.2290843","relation":{},"ISSN":["1549-8328","1558-0806"],"issn-type":[{"value":"1549-8328","type":"print"},{"value":"1558-0806","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6]]}}}