Abstract

This paper presents a technique for applying Fast FIR Algorithms (FFAs) to interpolation and decimation filters. In the event that the prototype filter has a symmetric impulse response, it is shown that the subfilters which result from the application of the FFA will be jointly symmetric. This fact may be exploited in order to further reduce the computational complexity of the system. The effect of transposition upon the proposed structure is discussed, and it is shown that transposition yields a more economical structure in the case of a decimation filter. The computational complexity of the proposed schemes is shown to compare favorably with that of the standard parallel filtering approach.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call