Adaptive windowed Fourier transform
From MaRDI portal
Adaptive Fourier transform with a data-driven window function is proposed in the paper. The algorithm, based on the confidence intervals intersection, is used for determination of the window length. It produces an adaptive, close to optimal, bias-to-variance trade-off. A generalization for the case of time-varying signals is given. Numerical examples and statistical analysis illustrate and confirm the presented theory.
Recommendations
- FFT formulations of adaptive Fourier decomposition
- scientific article; zbMATH DE number 5847088
- Adaptive fractional Fourier domain filtering
- Windowed special affine Fourier transform
- Recursive Fourier transform algorithms with integrated windowing
- An adaptive resolution computationally efficient short-time Fourier transform
- Algorithm of Adaptive Fourier Decomposition
- Windowed discrete Fourier transform for shifting data
- STFT With Adaptive Window Width Based on the Chirp Rate
- scientific article; zbMATH DE number 1533521
Cited in
(6)- Periodogram with varying and data-driven window length.
- Adaptive DFT-based interferometer fringe tracking
- Adaptive Hit or Miss Transform
- scientific article; zbMATH DE number 5847088 (Why is no real title available?)
- scientific article; zbMATH DE number 1192232 (Why is no real title available?)
- An adaptive resolution computationally efficient short-time Fourier transform
This page was built for publication: Adaptive windowed Fourier transform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853410)