Design of optimal FIR prefilters for wavelet coefficient computation

M.J. Shensa previously proposed an algorithm in the computation of wavelet series transform (WST) or continuous wavelet transform (CWT), where a sampled signal is first prefiltered. The Mallat's discrete wavelet transform (DWT) algorithm is then applied to the prefiltered sequence. The prefiltering is used to reduce the approximation error between the computed and desired wavelet transform coefficients. The optimal finite impulse response (FIR) prefilter design problem for the Shensa algorithm in computing the WST coefficients is studied. It is shown numerically that the error for the computed WST coefficients is reduced significantly more by using the designed optimal prefilters than that obtained from the algorithm of S. Mallat.<<ETX>>

[1]  I. Daubechies Orthonormal bases of compactly supported wavelets , 1988 .

[2]  O. Rioul,et al.  Wavelets and signal processing , 1991, IEEE Signal Processing Magazine.

[3]  Stéphane Mallat,et al.  A Theory for Multiresolution Signal Decomposition: The Wavelet Representation , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Olivier Rioul,et al.  Fast algorithms for discrete and continuous wavelet transforms , 1992, IEEE Trans. Inf. Theory.

[5]  F. Hlawatsch,et al.  Linear and quadratic time-frequency signal representations , 1992, IEEE Signal Processing Magazine.

[6]  Mark J. Shensa,et al.  The discrete wavelet transform: wedding the a trous and Mallat algorithms , 1992, IEEE Trans. Signal Process..