DocumentCode
1938527
Title
Convolution using the undecimated discrete wavelet transform
Author
Guo, Haitao ; Burrus, C.S.
Author_Institution
Dept. of Electr. & Comput. Eng., Rice Univ., Houston, TX, USA
Volume
3
fYear
1996
fDate
7-10 May 1996
Firstpage
1291
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
Keywords
convolution; wavelet transforms; FFT; computational complexity; convolution; digital signal processing; fast Fourier transform; linear transform; shift invariant transform; undecimated discrete wavelet transform; Computational complexity; Continuous wavelet transforms; Convolution; Discrete transforms; Discrete wavelet transforms; Fast Fourier transforms; Fourier transforms; Matrix decomposition; Signal processing; Wavelet transforms;
fLanguage
English
Publisher
ieee
Conference_Titel
Acoustics, Speech, and Signal Processing, 1996. ICASSP-96. Conference Proceedings., 1996 IEEE International Conference on
Conference_Location
Atlanta, GA
ISSN
1520-6149
Print_ISBN
0-7803-3192-3
Type
conf
DOI
10.1109/ICASSP.1996.543662
Filename
543662
Link To Document