A class of algorithms for continuous wavelet transform based on the circulant matrix (Q2331406): Difference between revisions
From MaRDI portal
Latest revision as of 21:34, 14 September 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A class of algorithms for continuous wavelet transform based on the circulant matrix |
scientific article |
Statements
A class of algorithms for continuous wavelet transform based on the circulant matrix (English)
0 references
29 October 2019
0 references
Summary: The Continuous Wavelet Transform (CWT) is an important mathematical tool in signal processing, which is a linear time-invariant operator with causality and stability for a fixed scale and real-life application. A novel and simple proof of the FFT-based fast method of linear convolution is presented by exploiting the structures of circulant matrix. After introducing Equivalent Condition of Time-domain and Frequency-domain Algorithms of CWT, a class of algorithms for continuous wavelet transform are proposed and analyzed in this paper, which can cover the algorithms in JLAB and WaveLab, as well as the other existing methods such as the \(cwt\) function in the toolbox of MATLAB. In this framework, two theoretical issues for the computation of CWT are analyzed. Firstly, edge effect is easily handled by using Equivalent Condition of Time-domain and Frequency-domain Algorithms of CWT and higher precision is expected. Secondly, due to the fact that linear convolution expands the support of the signal, which parts of the linear convolution are just the coefficients of CWT is analyzed by exploring the relationship of the filters of Frequency-domain and Time-domain algorithms, and some generalizations are given. Numerical experiments are presented to further demonstrate our analyses.
0 references
circulant matrix
0 references
continuous wavelet transform
0 references
linear convolution
0 references
circular convolution
0 references
FFT
0 references
0 references
0 references