Please use this identifier to cite or link to this item:
|Polynomial-time algorithm for designing digital filters with power-of-two coefficients
Lim, Yong Ching
|Li, Dongning,Song, Jianjian,Lim, Yong Ching (1993). Polynomial-time algorithm for designing digital filters with power-of-two coefficients. Proceedings - IEEE International Symposium on Circuits and Systems 1 : 84-87. ScholarBank@NUS Repository.
|This paper presents an algorithm for designing digital filters with coefficients expressible as sums of signed power-of-two (SPT) terms. For each filter gain, the time complexity of the algorithm is a second-order polynomial in the filter order and is a first-order polynomial in the filter wordlength. Unlike conventional methods where each coefficient is allocated a fixed number of SPT terms, our method allows the number of SPT terms for each coefficient to vary subject to the number of SPT terms for the entire filter. This provides us with the possibility of finding a better filter without increasing the number of adders, which determines the realization cost for a given filter length. Application of the algorithm to FIR filter designs shows that it achieves up to 8.9 dB improvement over simulated annealing and mixed integer linear programming on the normalized peak ripples of example filters.
|Proceedings - IEEE International Symposium on Circuits and Systems
|Appears in Collections:
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.