Please use this identifier to cite or link to this item: https://doi.org/10.1109/TSP.2002.800385
DC FieldValue
dc.titleA polynomial-time algorithm for designing FIR filters with power-of-two coefficients
dc.contributor.authorLi, D.
dc.contributor.authorLim, Y.C.
dc.contributor.authorLian, Y.
dc.contributor.authorSong, J.
dc.date.accessioned2014-10-07T04:23:04Z
dc.date.available2014-10-07T04:23:04Z
dc.date.issued2002-08
dc.identifier.citationLi, D., Lim, Y.C., Lian, Y., Song, J. (2002-08). A polynomial-time algorithm for designing FIR filters with power-of-two coefficients. IEEE Transactions on Signal Processing 50 (8) : 1935-1941. ScholarBank@NUS Repository. https://doi.org/10.1109/TSP.2002.800385
dc.identifier.issn1053587X
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/81904
dc.description.abstractThis paper presents a polynomial-time algorithm for designing digital filters with coefficients expressable as sums of signed power-of-two (SPT) terms. Our proposal is based on an observation that under certain circumstances, the realization cost of a filter with SPT coefficients depends only on the total number of SPT terms, regardless of how the terms distribute among the coefficients. Therefore, the number of SPT terms for each coefficient is not necessarily limited to a fixed number. Instead, they should be allowed to vary subject to a given number of total SPT terms for the filter. This provides the possibility of finding a better set of coefficients. Our algorithm starts with initializing all the quantized coefficient values to zero. It chooses one SPT term at a time and allocates it to the currently most deserving coefficient to minimize the L ∞ distance between the SPT coefficients and their corresponding infinite wordlength values. This process of allocating the SPT terms is repeated until the total number of SPT terms for the filter is equal to a prescribed number. For each filter gain, the time complexity is a second-order polynomial in the number of coefficients to be optimized and is a first-order polynomial in the filter wordlength.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/TSP.2002.800385
dc.sourceScopus
dc.subjectDiscrete coefficient FIR filters
dc.subjectFinite wordlength effects
dc.subjectFIR filter design
dc.subjectPolynomial time algorithm
dc.subjectPower-of-two coefficients
dc.typeArticle
dc.contributor.departmentELECTRICAL & COMPUTER ENGINEERING
dc.description.doi10.1109/TSP.2002.800385
dc.description.sourcetitleIEEE Transactions on Signal Processing
dc.description.volume50
dc.description.issue8
dc.description.page1935-1941
dc.description.codenITPRE
dc.identifier.isiut000177023100013
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

60
checked on May 17, 2019

WEB OF SCIENCETM
Citations

44
checked on May 8, 2019

Page view(s)

22
checked on May 14, 2019

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.