{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T02:28:39Z","timestamp":1747189719542,"version":"3.40.5"},"reference-count":25,"publisher":"World Scientific Pub Co Pte Ltd","issue":"09","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J CIRCUIT SYST COMP"],"published-print":{"date-parts":[[2021,7]]},"abstract":"<jats:p> Pass transistor logic (PTL) is a circuit design technique wherein transistors are used as switches. The reconfigurable mesh (RM) is a model that exploits the power of PTLs signal switching, by enabling flexible bus connections in a grid of processing elements containing switches. RM algorithms have theoretical results proving that [Formula: see text] can speed up computations significantly. However, the RM assumes that the latency of broadcasting a signal through [Formula: see text] switches (bus length) is 1. This is an unrealistic assumption preventing physical realizations of the RM. <\/jats:p><jats:p> We propose the restricted-RM (RRM) wherein the bus lengths are restricted to [Formula: see text], [Formula: see text]. We show that counting the number of 1-bits in an input of [Formula: see text] bits can be done in [Formula: see text] steps for [Formula: see text] by an [Formula: see text] RRM. An almost matching lower bound is presented, using a technique which adds to the few existing lower-bound techniques in this area. Finally, the algorithm was directly coded over an FPGA, outperforming an optimal tree of adders. <\/jats:p><jats:p> This work presents an alternative way of counting, which is fundamental for summing, beating regular Boolean circuits for large numbers, where summing a vast amount of numbers is the basis of any accelerator in embedded systems such as neural-nets and streaming. <jats:sup>a<\/jats:sup> <\/jats:p>","DOI":"10.1142\/s0218126621501577","type":"journal-article","created":{"date-parts":[[2021,1,18]],"date-time":"2021-01-18T16:05:32Z","timestamp":1610985932000},"page":"2150157","source":"Crossref","is-referenced-by-count":1,"title":["FPGA Realization of the Reconfigurable Mesh Counting Algorithm"],"prefix":"10.1142","volume":"30","author":[{"given":"Yosi","family":"Ben-Asher","sequence":"first","affiliation":[{"name":"Computer Science, University of Haifa, Haifa, ISRAEL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9065-6115","authenticated-orcid":false,"given":"Esti","family":"Stein","sequence":"additional","affiliation":[{"name":"Computer Science, Tel-Aviv Yaffo Academic College, Tel-Aviv, ISRAEL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladislav","family":"Tartakovsky","sequence":"additional","affiliation":[{"name":"Computer Science, University of Haifa, Haifa, ISRAEL"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2021,1,18]]},"reference":[{"key":"S0218126621501577BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0035168"},{"key":"S0218126621501577BIB002","first-page":"975","volume":"43","author":"Chawade S. D.","year":"2012","journal-title":"Int. J. Comput. Appl."},{"key":"S0218126621501577BIB003","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2008.25"},{"key":"S0218126621501577BIB004","first-page":"27","volume":"3","author":"Sneps-Sneppe M.","year":"2015","journal-title":"Int. J. Open Inf. Technol."},{"key":"S0218126621501577BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90288-5"},{"key":"S0218126621501577BIB007","doi-asserted-by":"publisher","DOI":"10.1109\/SPDP.1992.242720"},{"first-page":"130","volume-title":"Proc. Inter. Parallel Processing Symp.","author":"Jang J.","key":"S0218126621501577BIB008"},{"key":"S0218126621501577BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/0262-8856(93)90048-L"},{"key":"S0218126621501577BIB010","first-page":"III\u2013224","volume-title":"Proc. Int. Conf. Parallel Process","author":"Trahan J. L.","year":"1993"},{"key":"S0218126621501577BIB011","doi-asserted-by":"publisher","DOI":"10.1109\/71.80177"},{"key":"S0218126621501577BIB012","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.1988.196343"},{"key":"S0218126621501577BIB013","doi-asserted-by":"publisher","DOI":"10.1063\/1.1697872"},{"volume-title":"Proc. Workshop Reconfigurable Arch. and Algs","year":"1996","author":"Trahan J. L.","key":"S0218126621501577BIB014"},{"key":"S0218126621501577BIB015","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44614-1_12"},{"key":"S0218126621501577BIB016","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2002.1016547"},{"key":"S0218126621501577BIB017","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1996.0155"},{"key":"S0218126621501577BIB018","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1994.1117"},{"key":"S0218126621501577BIB019","first-page":"288","volume-title":"Proceedings of the ISCA 15th International Conference Computers and Their Applications","author":"Murshed M. M.","year":"2000"},{"key":"S0218126621501577BIB020","doi-asserted-by":"publisher","DOI":"10.1109\/IPPS.1992.223056"},{"key":"S0218126621501577BIB021","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2009.5161219"},{"key":"S0218126621501577BIB022","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2013.174"},{"key":"S0218126621501577BIB023","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00007-8"},{"key":"S0218126621501577BIB024","first-page":"11","volume":"80","author":"Ridha O. A. L. A.","year":"2013","journal-title":"Int. J. Comput. Appl."},{"key":"S0218126621501577BIB025","doi-asserted-by":"publisher","DOI":"10.1145\/1572471.1572475"},{"key":"S0218126621501577BIB026","first-page":"3","volume-title":"Proc. Int. Conf. Parallel and Distributed Processing Techniques and Applications (PDPTA)","author":"Ben-Asher Y.","year":"2016"}],"container-title":["Journal of Circuits, Systems and Computers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218126621501577","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T10:40:55Z","timestamp":1628592055000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218126621501577"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,18]]},"references-count":25,"journal-issue":{"issue":"09","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["10.1142\/S0218126621501577"],"URL":"https:\/\/doi.org\/10.1142\/s0218126621501577","relation":{},"ISSN":["0218-1266","1793-6454"],"issn-type":[{"type":"print","value":"0218-1266"},{"type":"electronic","value":"1793-6454"}],"subject":[],"published":{"date-parts":[[2021,1,18]]}}}