Discrete wavelets and fast wavelet transform
This paper aims at describing the discrete wavelet transform in a fashion similar to the discrete Fourier transform, namely as a transform acting on the discrete group \(\mathbb{Z}/N\mathbb{Z}\). The authors start by defining a multi-scale analysis on \(\mathbb{Z}/N\mathbb{Z}\), this leads to the well-known orthogonality conditions for subband filters. The described algorithm starts with a FFT of the input sequence, followed by a ``butterfly-type wavelet decomposition. Already the first step, i.e., computing the FFT, requires more operations than a standard discrete wavelet transform. The idea of imposing axioms for a multi-scale decomposition on \(\mathbb{Z}/N\mathbb{Z}\) is interesting. However, the presented paper is lacking mathematical rigour, moreover various changes of notation, e.g., the meaning of the scale and translation indices \(j\) and \(k\) varies on the first page, is distracting. For the entire collection see [Zbl 0773.00014].
- Minimum-bandwidth discrete-time wavelets
- Fast integral wavelet transform on a dense set of the time-scale domain
- Wavelets generated by using discrete singular convolution kernels
- scientific article; zbMATH DE number 6492561 (Why is no real title available?)
- Fast algorithms for discrete and continuous wavelet transforms
- Incremental Refinement of Computation for the Discrete Wavelet Transform
- scientific article; zbMATH DE number 829809 (Why is no real title available?)
- Discrete Wavelet Transforms in the Large Time-Frequency Analysis Toolbox for MATLAB/GNU Octave
- Fast Discrete Curvelet Transforms
This page was built for publication: Discrete wavelets and fast wavelet transform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3139447)