Recursive structures are introduced for implementing long linear-phase finite impulse response (FIR) filters using a very small number of multipliers. The implementation uses the principle of switching and resetting between two identical copies of the same infinite impulse response (IIR) filter. The impulse response of the resulting filters is a truncated and shifted version of the response of a filter G(z)G(z/sup -1/) where G(z) is a stable IIR stable and G(z/sup -1/) is the corresponding unstable IIR filter. The filters are implemented as a parallel connection of several branches, each branch generating a truncated response corresponding to a complex conjugate pole pair and its mirror-image pair. The truncation is performed using a feedforward term which provides pole-zero cancellations. To stabilize the pole-zero cancellations, and to avoid the quantization error from growing too much, the branch filters are implemented by applying the principle of switching and resetting. It is shown, by means of an example, that by using this approach a nearly optimum FIR filter of order larger than 500 using just 17 adjustable parameters can be designed.<<ETX>>
[1]
O. Herrmann,et al.
Practical design rules for optimum finite impulse response low-pass digital filters
,
1973
.
[2]
Christakis Charalambous,et al.
Acceleration of the leastpth algorithm for minimax optimization with engineering applications
,
1979,
Math. Program..
[3]
Adly T. Fam.
MFIR filters: Properties and applications
,
1981
.
[4]
Adly T. Fam,et al.
Subfilter approach for designing efficient FIR filters
,
1988,
1988., IEEE International Symposium on Circuits and Systems.