Please use this identifier to cite or link to this item:
|Title:||A polynomial-time algorithm for designing FIR filters with power-of-two coefficients||Authors:||Li, D.
|Keywords:||Discrete coefficient FIR filters
Finite wordlength effects
FIR filter design
Polynomial time algorithm
|Issue Date:||Aug-2002||Citation:||Li, 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||Abstract:||This 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.||Source Title:||IEEE Transactions on Signal Processing||URI:||http://scholarbank.nus.edu.sg/handle/10635/81904||ISSN:||1053587X||DOI:||10.1109/TSP.2002.800385|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jun 11, 2021
WEB OF SCIENCETM
checked on Jun 3, 2021
checked on Jun 9, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.