Convolution using the undecimated discrete wavelet transform

Authors:
Haitao Guo;C. S. Burrus
Affiliations:
Dept. of Electr. & Comput. Eng., Rice Univ., Houston, TX, USA;-
Venue:
ICASSP '96 Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03
Year:
1996

Citing 0
Cited 1

Representation and identification of systems in the wavelet transform domain

ASM '07 The 16th IASTED International Conference on Applied Simulation and Modelling

Quantified Score

Hi-index	0.00

Visualization

Abstract

Convolution is one of the most widely used digital signal processing operations. It can be implemented using the fast Fourier transform (FFT) with a computational complexity of O (N log N). The undecimated discrete wavelet transform (UDWT) is linear and shift invariant, so it can also be used to implement convolution. We propose a scheme to implement the convolution using the UDWT, and study its advantages and limitations.