Filter Bank Reconstruction

% latex2html id marker 22056\psfrag{w}{{\Large $f$\ }} % shoul...
...caption{Interpolated, remodulated, filter-bank sum.}

Since the channel signals are downsampled, we generally need interpolation in the reconstruction. Figure 8.18 indicates how we might pursue this. From studying the overlap-add framework, we know that the inverse STFT is exact when the window $ w(n)$ is $ \hbox{\sc Cola}(R)$, that is, when $ \hbox{\sc Alias}_R(w)$ is constant. In only these cases can the STFT be considered a perfect reconstruction filter bank. From the Poisson Summation Formula in §7.3.1, we know that a condition equivalent to the COLA condition is that the window transform $ W(\omega)$ have notches at all harmonics of the frame rate, i.e., $ W(2\pi k/R)=0$ for $ k=1,2,3,R-1$. In the present context (filter-bank point of view), perfect reconstruction appears impossible for $ R>1$, because for ideal reconstruction after downsampling, the channel anti-aliasing filter ($ w$) and interpolation filter ($ f$) have to be ideal lowpass filters. This is a true conclusion in any single channel, but not for the filter bank as a whole. We know, for example, from the overlap-add interpretation of the STFT that perfect reconstruction occurs for hop-sizes greater than 1 as long as the COLA condition is met. This is an interesting paradox to which we will return shortly.

What we would expect in the filter-bank context is that the reconstruction can be made arbitrarily accurate given better and better lowpass filters $ w$ and $ f$ which cut off at $ \omega_c = \pi/R$ (the folding frequency associated with down-sampling by $ R$). This is the right way to think about the STFT when spectral modifications are involved.

In Chapter 10 we will develop the general topic of perfect reconstruction filter banks, and derive various STFT processors as special cases.

Next Section:
Properly Anti-Aliasing Window Transforms
Previous Section:
The Nyquist Property on the Unit Circle