On adaptive wavelet packets

An algorithm is presented for fast implementation of time-varying wavelet packets maintaining perfect reconstruction throughout transitions. It is based on filter banks known as the extended lapped transforms in an association following the paths of a binary-tree. Methods for pruning or expanding the branches of the tree are presented, and a discussion on adaptation issues is given.<<ETX>>

[1]  H. S. Malvar.  Fast computation of wavelet transforms with the extended lapped transform , 1992, [Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[2]  P. P. Vaidyanathan,et al.  Paraunitary filter banks and wavelet packets , 1992, [Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[3]  M. Vetterli,et al.  Arbitrary orthogonal tilings of the time-frequency plane , 1992, [1992] Proceedings of the IEEE-SP International Symposium on Time-Frequency and Time-Scale Analysis.

[4]  K. H. Barratt.  Digital Coding of Waveforms , 1985 .

[5]  Ricardo L. de Queiroz,et al.  Adaptive extended lapped transforms , 1993, 1993 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[6]  Henrique S. Malvar,et al.  Signal processing with lapped transforms , 1992 .

[7]  Henrique S. Malvar,et al.  On the asymptotic performance of hierarchical transforms , 1992, IEEE Trans. Signal Process..

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