THE DISCRETE WAVELET TRANSFORM - WEDDING THE A TROUS AND MALLAT ALGORITHMS

In a general sense this paper represents an effort to clarify the relationship of discrete and continuous wavelet transforms. More narrowly, it focuses on bringing together two separately motivated implementations of the wavelet transform, the algorithme a trous and Mallat's multiresolution decomposition. It is observed that these algorithms are both special cases of a single filter bank structure, the discrete wavelet transform, the behavior of which is governed by one's choice of filters. In fact, the a trous algorithm, originally devised as a computationally efficient implementation, is more properly viewed as a nonorthonormal multiresolution algorithm for which the discrete wavelet transform is exact. Moreover, it is shown that the commonly used Lagrange a trous filters are in one-to-one correspondence with the convolutional squares of the Daubechies filters for orthonormal wavelets of compact support. A systematic framework for the discrete wavelet transform is provided, and conditions are derived under which it computes the continuous wavelet transform exactly. Suitable filter constraints for finite energy and boundedness of the discrete transform are also derived. Finally, relevant signal processing parameters are examined, and it is remarked that orthonormality is balanced by restrictions on resolution.