Live briefing
Everything about Sliding DFT
Recursive algorithm in applied mathematics
In digital signal processing, the sliding discrete Fourier transform is a recursive algorithm for computing a sequence of discrete Fourier transforms on overlapping data windows. Successive windows differ by only one sample, so the transform for the new window can be obtained by updating the transform of the previous window rather than recomputing it from scratch. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Sliding DFTA 5-minute orientation
- Skim a recent paper: Sliding DFT-Based Fault Location Scheme for DC MicrogridInfluential work since 2022
- Read the landmark paper: dsp tips & tricks - the sliding DFTCited 433 times
- Go sideways: Gabor transformA closely related topic
- Go sideways: Discrete-time Fourier transformA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
dsp tips & tricks - the sliding DFT
An update to the sliding DFT
On the advantages of the LMS spectrum analyzer over nonadaptive implementations of the sliding-DFT
Online Identification of a Mechanical System in Frequency Domain Using Sliding DFT
A Power-Line Interference Canceler Based on Sliding DFT Phase Locking Scheme for ECG Signals
Recursive sliding DFT algorithms: A review
A new joint sliding-window ESPRIT and DFT scheme for waveform distortion assessment in power systems
Sliding DFT-Based Vibration Mode Estimator for Single-Link Flexible Manipulator
🆕 Influential since 2022
Sliding DFT-Based Fault Location Scheme for DC Microgrid
Friction mechanisms of WS2 in humid environments: Investigating H2O adsorption via DFT computations and sliding friction experiments
Advanced Control Algorithm for Three-Phase Shunt Active Power Filter Using Sliding DFT
Improved Sliding DFT Filter With Fractional and Integer Frequency Bin-Index
A Use Case of Sliding DFT in Capacitance and Resistance Sensors Interface
📚 Books worth reading
Open Library didn't respond; try again in a moment.
🔗 Related topics
- Gabor transform The Gabor transform, named after Dennis Gabor, is a special case of the short-time Fourier transform. It is used to determine the sinusoidal frequency…
- Discrete-time Fourier transform In mathematics, the discrete-time Fourier transform (DTFT) is a form of Fourier analysis that is applicable to a sequence of discrete values. The DTFT…
- Discrete Fourier transform In mathematics, the discrete Fourier transform (DFT) is a discrete version of the Fourier transform that converts a finite sequence of numbers into another…
- Discrete sine transform In mathematics, the discrete sine transform (DST) is a Fourier-related transform similar to the discrete Fourier transform (DFT), but using a purely real…
- Hexagonal fast Fourier transform The hexagonal fast Fourier transform (HFFT) is a tool in image and signal processing which uses fast Fourier transform (FFT) routines to compute the discrete…
- Rader's FFT algorithm Rader's algorithm (1968), named for Charles M. Rader of MIT Lincoln Laboratory, is a fast Fourier transform (FFT) algorithm that computes the discrete…
- Finite impulse response In signal processing, a finite impulse response (FIR) filter is a filter whose impulse response (or response to any finite length input) is of finite duration…
- Cooley–Tukey FFT algorithm The Cooley–Tukey algorithm, named after J. W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re-expresses the discrete…