Dynamic Programming Methods for Designing FIR
Filters Using Coefficients · 1986
In this paper, we describe an efficient design procedure for designing FIR filters whose general structure consists of a trans- versal filter with tap coefficients restricted to -1, 0, or +1 and cas- caded with simple recursive sections. Due to the multiplication-free na- ture of this transversal filter, the configuration is particularly attrac- tive from the standpoint of implementation with very simple hardware. Dynamic programming methods in conjunction with a mean-square error functional are presented to select the set of coefficient values for the taps. The approach is based on the assumption that the approxi- mation sequence can be described as the output of a sequential machine whose state corresponds to the state-space representation of the sec- tions in cascade with the transveral filter.