{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:02:45Z","timestamp":1760241765413,"version":"build-2065373602"},"reference-count":20,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2018,9,3]],"date-time":"2018-09-03T00:00:00Z","timestamp":1535932800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers"],"abstract":"<jats:p>This work proposes the first scaler designed specifically for the three-moduli set      M 1  =  {  2  n + 1   \u2212 1 ,  2 n  ,  2 n  \u2212 1 }     . Hence, there is no other functionally similar scaler to compare the proposed scaler with. However, when compared with the latest published scalers for a different moduli set,      M 2  =  {  2 n  + 1 ,  2 n  ,  2 n  \u2212 1 }     , the proposed scaler has a better area and power performance, while it requires a longer time delay. As demonstrated in earlier publications, replacing the     (  2 n  + 1 )     channel in the     M 2     moduli set by the     (  2  n + 1   \u2212 1 )     channel, to form the     M 1     moduli set, considerably improves the overall time performance of residue-based multiply\u2013accumulate arithmetic units.<\/jats:p>","DOI":"10.3390\/computers7030046","type":"journal-article","created":{"date-parts":[[2018,9,3]],"date-time":"2018-09-03T10:50:51Z","timestamp":1535971851000},"page":"46","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["New Residue Number System Scaler for the Three-Moduli Set {2n+1 \u2212 1, 2n, 2n \u2212 1}"],"prefix":"10.3390","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4785-3698","authenticated-orcid":false,"given":"Ahmad","family":"Hiasat","sequence":"first","affiliation":[{"name":"Department of Computer Engineering, School of Engineering, Princess Sumaya University for Technology, P.O. Box 1438, Al-Jubeiha, Amman 11941, Jordan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2018,9,3]]},"reference":[{"key":"ref_1","unstructured":"Soderstrand, M.A., Jenkins, W., Jullien, G., and Taylor, F. (1986). Residue Number System Arithmetic: Modern Applications in Digital Signal Processing, IEEE Press."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1093\/comjnl\/47.1.93","article-title":"A suggestion for a fast residue multiplier for a family of moduli of the form (2n \u2212 (2p \u00b1 1))","volume":"47","author":"Hiasat","year":"2004","journal-title":"Comput. J."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1049\/ip-cds:19982396","article-title":"Efficient digital sweep oscillator with extremely low sweep rates","volume":"145","author":"Hiasat","year":"1998","journal-title":"IEE Proc. Circuits Devices Syst."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1545","DOI":"10.1109\/TVLSI.2012.2210916","article-title":"Efficient RNS implementation of elliptic curve point multiplication over GF(p)","volume":"21","author":"Esmaeildoust","year":"2013","journal-title":"IEEE Trans. VLSI Syst."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1109\/MCAS.2016.2614714","article-title":"Combining residue arithmetic to design efficient cryptographic circuits and systems","volume":"16","author":"Sousa","year":"2016","journal-title":"IEEE Circuits Syst. Mag."},{"key":"ref_6","unstructured":"Hiasat, A. (1997, January 6\u20139). Design and implementation of an RNS division algorithm. Proceedings of the 13th IEEE Sympsoium on Computer Arithmetic, Asilomar, CA, USA."},{"key":"ref_7","unstructured":"Ye, J., Ma, S., and Hu, J. (2008, January 20\u201322). An efficient 2n RNS scaler for moduli set (2n \u2212 1, 2n, 2n + 1). Proceedings of the 2008 International Symposium on Information Science and Engineering ISISE, Shanghai, China."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/S1383-7621(03)00062-6","article-title":"Residue Number System to Binary Converter for the Moduli Set (2n\u22121, 2n \u2212 1, 2n + 1)","volume":"49","author":"Hiasat","year":"2003","journal-title":"J. Syst. Arch."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"2686","DOI":"10.1109\/TCSI.2011.2142950","article-title":"Simple, fast, and exact RNS scaler for the three-moduli set (2n \u2212 1, 2n, 2n + 1)","volume":"58","author":"Chang","year":"2011","journal-title":"IEEE Trans. Circuits Syst. I"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"2911","DOI":"10.1109\/TCSI.2012.2206491","article-title":"A VLSI efficient programmable power-of-two scaler for (2n \u2212 1, 2n, 2n + 1)","volume":"59","author":"Low","year":"2012","journal-title":"IEEE Trans. Circuits Syst. I"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1936","DOI":"10.1109\/TVLSI.2012.2221752","article-title":"Efficient VLSI implementation of 2n scaling of signed integer in RNS (2n \u2212 1, 2n, 2n + 1)","volume":"21","author":"Tay","year":"2013","journal-title":"IEEE Trans. Very Large Scale Integr. Syst."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"3322","DOI":"10.1109\/TC.2015.2401026","article-title":"2n RNS scalers for extended 4-moduli sets","volume":"64","author":"Sousa","year":"2015","journal-title":"IEEE Trans. Comput."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1253","DOI":"10.1109\/TC.2017.2652474","article-title":"Efficient RNS scalers for the extended three-moduli set (2n \u2212 1, 2n+p, 2n + 1)","volume":"66","author":"Hiasat","year":"2017","journal-title":"IEEE Trans. Comput."},{"key":"ref_14","unstructured":"Zimmermann, R. (1999, January 14\u201316). Efficient VLSI implementation of modulo (2n \u00b1 1) addition and multiplication. Proceedings of the 14th IEEE Symposium on Computer Arithmetic (Cat. No.99CB36336), Adelaide, Australia."},{"key":"ref_15","unstructured":"Hiasat, A., and Abdel-Aty-Zohdy, H. (1994, January 3\u20135). Design and implementation of a fast and compact residue-based semi-custom VLSI arithmetic chip. Proceedings of the 1994 37th Midwest Symposium on Circuits and Systems, Lafayette, LA, USA."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"937","DOI":"10.1109\/82.868463","article-title":"RNS arithmetic multiplier for medium and large moduli","volume":"47","author":"Hiasat","year":"2000","journal-title":"IEEE Trans. Circuits Syst."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"2263","DOI":"10.1109\/TCSI.2012.2185334","article-title":"Area-power efficient modulo 2n \u2212 1 and modulo 2n + 1 multipliers for (2n \u2212 1, 2n, 2n + 1) based RNS","volume":"59","author":"Muralidharan","year":"2012","journal-title":"IEEE Trans. Circuits Syst. I"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"20160090","DOI":"10.1587\/elex.13.20160090","article-title":"New adaptable three-moduli {2n+k, 2n \u2212 1, 2n\u22121 \u2212 1} residue number system-based finite impulse response implementation","volume":"13","author":"Sheu","year":"2016","journal-title":"IEICE Electron. Express"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1109\/12.863036","article-title":"High-speed parallel-prefix modulo 2n \u2212 1 adders","volume":"49","author":"Kalamboukas","year":"2000","journal-title":"IEEE Trans. Comput."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1109\/TC.2002.1146705","article-title":"Diminished-one modulo 2n + 1 adder design","volume":"51","author":"Vergos","year":"2002","journal-title":"IEEE Trans. Comput."}],"container-title":["Computers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-431X\/7\/3\/46\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:18:30Z","timestamp":1760195910000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-431X\/7\/3\/46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,3]]},"references-count":20,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2018,9]]}},"alternative-id":["computers7030046"],"URL":"https:\/\/doi.org\/10.3390\/computers7030046","relation":{},"ISSN":["2073-431X"],"issn-type":[{"type":"electronic","value":"2073-431X"}],"subject":[],"published":{"date-parts":[[2018,9,3]]}}}