Discrete wavelets and fast wavelet transform

From MaRDI portal





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].











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)