Complexity evaluation of conjugate quadrature mirror filter banks

The aim of this paper is to assess the complexity of different implementations of CQF (Conjugate Quadrature Mirror Filters) analysis and synthesis filter banks. In particular, we compare the classical structure based on FIR (Finite Impulse Response) filters with the alternative implementation based on binomial filters. In both cases, we describe how it is possible to reduce complexity exploiting some inherent redundancies in the analysis or synthesis filter bank. Results show that, with respect to the FIR usual scheme, a complexity reduction of at least a factor 4 is achievable by a joint use of binomial filters and “smart” structures