{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T10:40:40Z","timestamp":1761561640301,"version":"3.28.0"},"reference-count":27,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1109\/acssc.2011.6189975","type":"proceedings-article","created":{"date-parts":[[2012,5,1]],"date-time":"2012-05-01T21:16:13Z","timestamp":1335906973000},"page":"154-159","source":"Crossref","is-referenced-by-count":7,"title":["On building general modular adders from standard binary arithmetic components"],"prefix":"10.1109","author":[{"given":"G.","family":"Jaberipur","sequence":"first","affiliation":[]},{"given":"B.","family":"Parhami","sequence":"additional","affiliation":[]},{"given":"S.","family":"Nejati","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/82.142036"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/12.980018"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/TCS.1987.1086130"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2004.60"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2005.63"},{"key":"13","first-page":"57","article-title":"Unified Approach to the Design of Modulo-(2n\ufffd 1) Adders Based on Signed-LSB Representation of Residues","author":"jaberipur","year":"2009","journal-title":"Proc 10th IEEE Symp Computer Arithmetic"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/12.863036"},{"key":"11","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1109\/TCSI.2007.895515","article-title":"RNS-to-Binary Converters for Two Four-Moduli Sets {2n-1, 2n, 2n+1, 2n+1-1} and {2n-1, 2 n, 2n+1, 2n+1+1}","volume":"54","author":"mohan","year":"2007","journal-title":"IEEE Trans Circuits and Systems I"},{"key":"12","doi-asserted-by":"crossref","first-page":"1296","DOI":"10.1109\/TCSI.2003.817789","article-title":"An Efficient Reverse Converter for the 4-Moduli Set {2n-1, 2n, 2n+1, 22n+1} Based on the New Chinese Remainder Theorem","volume":"50","author":"cao","year":"2003","journal-title":"IEEE Trans Circuits and Systems I"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1049\/ip-cdt:20010202"},{"key":"20","first-page":"508","article-title":"Design of High-Speed Residue-to-Binary Number SystemConverter Based on Chinese Remainder Theorem","author":"piestrak","year":"1994","journal-title":"Proc IEEE Int'lConf Computer Design"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2003.821516"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2007.05.040"},{"key":"24","first-page":"643","article-title":"New Reverse Converters for the Moduli Set {2n -3, 2 n-1, 2n+1, 2n+3}","volume":"62","author":"mohan","year":"2008","journal-title":"Electron Commun Jpn"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1973.5009159"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.1999.762841"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2009.2038166"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/j.vlsi.2008.04.004"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2007.895369"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2007.890623"},{"key":"1","doi-asserted-by":"crossref","DOI":"10.1142\/p523","author":"omondi","year":"2007","journal-title":"Residue Number Systems Theory and Implementation"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1049\/iet-cds.2009.0284"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1049\/iet-cdt:20060026"},{"key":"5","first-page":"25","article-title":"SelectedRNSBases for Modular Multiplication","author":"bajard","year":"2009","journal-title":"Proc 10th IEEE Symp Computer Arithmetic"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2010.2040302"},{"key":"9","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1109\/ARITH.1999.762842","article-title":"A Reverse Converter for the 4-Moduli Super Set {2n-1, 2 n, 2n+1, 2n+1+1}","author":"bhardwaj","year":"1999","journal-title":"Proc 14th IEEE Symp Computer Arithmetic"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1049\/iet-cdt:20060059"}],"event":{"name":"2011 45th Asilomar Conference on Signals, Systems and Computers","start":{"date-parts":[[2011,11,6]]},"location":"Pacific Grove, CA, USA","end":{"date-parts":[[2011,11,9]]}},"container-title":["2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6185739\/6189941\/06189975.pdf?arnumber=6189975","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,28]],"date-time":"2019-06-28T04:15:03Z","timestamp":1561695303000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6189975\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/acssc.2011.6189975","relation":{},"subject":[],"published":{"date-parts":[[2011,11]]}}}