sliding dft
/S L AY1 D IH0 NG D IY0 EH0 F T/N
- 1
In applied mathematics, the sliding discrete Fourier transform is a recursive algorithm to compute successive STFTs of input data frames that are a single sample apart (hopsize − 1).
Translate “sliding dft” into another language
Choose a language below to open the translator with English selected as the source language.