{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T04:40:35Z","timestamp":1729658435569,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1109\/tsp.2012.6256380","type":"proceedings-article","created":{"date-parts":[[2012,8,6]],"date-time":"2012-08-06T20:53:16Z","timestamp":1344286396000},"page":"662-666","source":"Crossref","is-referenced-by-count":16,"title":["Digital filter implementation based on the RNS with diminished-1 encoded channel"],"prefix":"10.1109","author":[{"given":"Dragana","family":"Zivaljevic","sequence":"first","affiliation":[]},{"given":"Negovan","family":"Stamenkovic","sequence":"additional","affiliation":[]},{"given":"Vidosav","family":"Stojanovic","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/TCS.1977.1084321"},{"key":"13","first-page":"1473","article-title":"An improved residue-to-binary converter","volume":"47","author":"wang","year":"2000","journal-title":"IEEE Transactions on Circuits and Systems-I"},{"journal-title":"Digital Signal Processing Signals Systems and Filters","year":"2006","author":"antoniou","key":"14"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2003.1213353"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2005.63"},{"key":"3","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1109\/ARITH.1999.762841","article-title":"Efficient VLSI Implementation of Modulo (2n \ufffd 1) Addition and Multiplication","author":"zimmermann","year":"1999","journal-title":"Proceedings of the 14th IEEE Symposium on Computer Arithmetic"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1976.1162834"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2003.821524"},{"key":"10","first-page":"760","article-title":"6.78 gigabits per second implementation of the IDEA cryptographic algorithm","author":"ha?ma?la?inen","year":"2002","journal-title":"Proceedings of the 12th Conference on Field-Programmable Logic and Applications (FPL 2002)"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1080\/0020721031000148263"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/DSD.2004.1333279"},{"key":"5","first-page":"211","article-title":"High speed parallel-prefix modulo 2n + 1 adders for diminished-one operands","author":"vergos","year":"2001","journal-title":"Proceedings of 15th IEEE Symposium on Computer Arithmetic"},{"key":"4","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF00929618","article-title":"An efficient tree architecture for modulo 2n + 1 multiplication","volume":"14","author":"wang","year":"1996","journal-title":"VLSI Signal Processing"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1049\/iet-cds.2009.0284"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/ICSCS.2008.4746907"}],"event":{"name":"2012 35th International Conference on Telecommunications and Signal Processing (TSP)","start":{"date-parts":[[2012,7,3]]},"location":"Prague, Czech Republic","end":{"date-parts":[[2012,7,4]]}},"container-title":["2012 35th International Conference on Telecommunications and Signal Processing (TSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6247525\/6256179\/06256380.pdf?arnumber=6256380","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T22:31:12Z","timestamp":1497997872000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6256380\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/tsp.2012.6256380","relation":{},"subject":[],"published":{"date-parts":[[2012,7]]}}}