On the complexity of multiplierless direct and polyphase FIR filter structures

This paper discusses the complexity trend in different finite length impulse response (FIR) filter structures when using multiplierless (shift-and-add) realization. We derive the total number of adders required by the transposed direct form, polyphase, and reduced-complexity polyphase FIR filter structures. A comparison of the arithmetic complexities of these structures for different filter characteristics is performed. The simulation results show that considering both the high level structure and the algorithm used to realize the subfilters gives a more accurate measure of complexity comparison between different FIR filter structures.