Analysis of information sources in references of the Wikipedia article "Discrete-time Fourier transform" in English language version.
samples of the Fourier transform of an aperiodic sequence x[n] can be thought of as DFS coefficients of a periodic sequence obtained through summing periodic replicas of x[n].
Fortunately, there is a much more elegant solution, as shown in Figure 20 below, known as the Polyphase or WOLA (Weight, Overlap and Add) FFT.
The "Weight Overlap and Add" or WOLA or its subset the "Polyphase DFT", is becoming more established and is certainly very efficient where large, high quality filter banks are required.
The "Weight Overlap and Add" or WOLA or its subset the "Polyphase DFT", is becoming more established and is certainly very efficient where large, high quality filter banks are required.
the DFS coefficients for the periodized signal are a discrete set of values for its DTFT
To perform M-fold WOLA for an N-point DFT, M·N real input samples aj first multiplied by a window function wj of same size
{{cite journal}}
: CS1 maint: bot: original URL status unknown (link)The "Weight Overlap and Add" or WOLA or its subset the "Polyphase DFT", is becoming more established and is certainly very efficient where large, high quality filter banks are required.