Short-length FIR filters and their use in fast nonrecursive filtering

The basic tools required for an efficient use of the recently proposed fast finite impulse response (FIR) algorithms are provided. These algorithms not only reduce arithmetic complexity but also partially maintain the multiply-accumulate structure, thus resulting in efficient implementations. A set of basic algorithms is derived, together with some rules for combining them. Their efficiency is compared with that of classical schemes in the case of three different criteria, corresponding to various types of implementation. It is shown that this class of algorithms (which includes classical ones as special cases) makes it possible to find the best tradeoff corresponding to any criterion.<
>