{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T03:15:18Z","timestamp":1729653318157,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/iscas.2006.1692658","type":"proceedings-article","created":{"date-parts":[[2006,9,22]],"date-time":"2006-09-22T13:01:13Z","timestamp":1158930073000},"page":"4","source":"Crossref","is-referenced-by-count":1,"title":["The design of multiplierless FIR filters with a minimum adder step and reduced hardware complexity"],"prefix":"10.1109","author":[{"given":"D.L.","family":"Maskell","sequence":"first","affiliation":[]},{"family":"Jussipekka Leiwo","sequence":"additional","affiliation":[]},{"given":"J.C.","family":"Patra","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/43.739059"},{"key":"15","first-page":"1349","article-title":"FIR filter design program that matches specifications rather than filter coefficients results in large savings in FPGA resources","volume":"2","author":"tan","year":"2001","journal-title":"Asilomar Conf Signals Syst Comp"},{"key":"16","first-page":"185","article-title":"A systemic algorithm for the design of multiplierless FIR filters","volume":"2","author":"yli-kaakinen","year":"2001","journal-title":"Proc 2001 IEEE-ISCAS"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2004.831725"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2003.1205806"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2004.840552"},{"key":"12","doi-asserted-by":"crossref","first-page":"1525","DOI":"10.1109\/TCAD.2002.804374","article-title":"Digital filter synthesis based on an algorithm to generate all minimum signed digit representations","volume":"21","author":"park","year":"2002","journal-title":"IEEE Trans Computer-Aided Design Integr Circuits Syst"},{"year":"0","key":"3"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1983.1164085"},{"key":"1","first-page":"391","article-title":"A novel modified branch-and-bound technique for discrete optimization over canonical signed-digit number space","volume":"5","author":"ashrafzadeh","year":"1998","journal-title":"IEEE ISCAS"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/82.539000"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/82.392318"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/31.31347"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/31.1785"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/31.101268"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/82.466647"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/82.471396"}],"event":{"name":"2006 IEEE International Symposium on Circuits and Systems","acronym":"ISCAS-06","location":"Island of Kos, Greece"},"container-title":["2006 IEEE International Symposium on Circuits and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/11145\/35661\/01692658.pdf?arnumber=1692658","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,17]],"date-time":"2017-06-17T05:30:33Z","timestamp":1497677433000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1692658\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/iscas.2006.1692658","relation":{},"subject":[]}}