Efficient computation of the wavelet transforms

Author

Gopinath, R.A. ; Burrus, C.S.

Author_Institution

Dept. of Electr. & Comput. Eng., Rice Univ., Houston, TX, USA

fYear

1990

fDate

3-6 Apr 1990

Firstpage

1599

Abstract

An efficient algorithm is presented for the computation of the continuous wavelet transform (CWT). CWTs arise in the analysis of bandpass signals that are scale-time perturbed. To detect scale-time perturbed signals, the CWT of the received signal has to be computed with respect to the signals being detected. Efficient algorithms exist for the computation of the discrete wavelet transform, because the DWT wavelets give rise to quadrature mirror filters which can be implemented using lattice structures. Computation of the CWT with respect to an arbitrary wavelet (not necessarily a DWT wavelet), is time consuming. The DWT wavelets are used to compute the CWT of a signal with respect to an arbitrary wavelet. This is accomplished by using the computational properties of compactly supported DWT wavelet bases

Keywords

signal detection; time-domain analysis; transforms; continuous wavelet transform; discrete wavelet transform; scale-time perturbed signals; Band pass filters; Continuous wavelet transforms; Discrete wavelet transforms; Equations; Finite impulse response filter; Lattices; Mirrors; Signal analysis; Signal detection; Wavelet transforms;

fLanguage

English

Publisher

ieee

Conference_Titel

Acoustics, Speech, and Signal Processing, 1990. ICASSP-90., 1990 International Conference on

Conference_Location

Albuquerque, NM

ISSN

1520-6149

Type

conf

DOI

10.1109/ICASSP.1990.115729

Filename

115729