The sliding DFT

  title={The sliding DFT},
  author={Eric A. Jacobsen and Richard G. Lyons},
  journal={IEEE Signal Process. Mag.},
The sliding DFT process for spectrum analysis was presented and shown to be more efficient than the popular Goertzel (1958) algorithm for sample-by-sample DFT bin computations. The sliding DFT provides computational advantages over the traditional DFT or FFT for many applications requiring successive output calculations, especially when only a subset of the DFT output bins are required. Methods for output stabilization as well as time-domain data windowing by means of frequency-domain… 

Figures from this paper

Guaranteed-Stable Sliding DFT Algorithm With Minimal Computational Requirements
  • Chun-Su Park
  • Computer Science
    IEEE Transactions on Signal Processing
  • 2017
The proposed oSDFT algorithm directly computes the DFT bins of the shifted window by simply adding (or subtracting) the bins of a previous window and an updating vector and it is shown that the updating vector can be efficiently computed with a low complexity in the sliding transform scenario.
VLSI implementation of sliding window DFT
Hardware architecture to perform the sliding window DFT on FPGA with customized and configurable DFT block and structured the data flow using memory arrays to realize sliding window operation is presented.
Single Bin Sliding Discrete Fourier Transform
The conventional method for spectrum analysis is the discrete Fourier transform (DFT), usually implemented using a fast Fourier transform (FFT) algorithm. However, certain applications require an
Sliding Discrete Fourier Transform for 2D Signal Processing
The algorithm for the fast implementation of the DFT on the Two-Dimensional (2D) sliding windows is given and the computational requirement of the said algorithm is found to be lowest among the existing ones.
Chapter 2 Single Bin Sliding Discrete Fourier Transform
The conventional method for spectrum analysis is the discrete Fourier transform (DFT), usually implemented using a fast Fourier transform (FFT) algorithm. However, certain applications require an
The k D Sliding Window Fourier Transform : Algorithms , Applications , and Statistics April 22 , 2017
This thesis gets around the stationarity assumption with a k-dimensional SWFT, the focus of this thesis, and identifies various applications either using the kD SWFT explicitly, or could easily use it.
Low-complexity hopping DFT design based on a compact recursive structure
A novel hopping discrete Fourier transform (DFT) algorithm and its architecture design for efficiently computing time–frequency spectra are presented. Since the sliding process is adopted sample by
2D Discrete Fourier Transform on Sliding Windows
  • Chun-Su Park
  • Computer Science, Engineering
    IEEE Transactions on Image Processing
  • 2015
The theoretical analysis shows that the computational requirement of the proposed 2D SDFT algorithm is the lowest among existing 2D DFT algorithms, and the output of the 2DSDFT is mathematically equivalent to that of the traditional DFT at all pixel positions.
The hopping discrete fractional Fourier transform


A numerically-stable sliding-window estimator and its application to adaptive filters
  • S. Douglas, J. Soh
  • Computer Science
    Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36136)
  • 1997
A recursive system whose output at every Lth sample time is equivalent to that of the sliding DFT and whose numerical errors do not grow with time is presented.
Generalized sliding FFT and its application to implementation of block LMS adaptive filters
The generalized sliding fast Fourier transform (GSFFT) as an efficient implementation of the hopping FFT is introduced, and the frequency domain block LMS (FBLMS) adaptive filters are revised, and their implementations for block lengths less than the length of the adaptive filter are studied.
A comment on the computational complexity of sliding FFT
The sliding fast Fourier transform (FFT) is reviewed and is shown to have the computational complexity of N complex multiplications per sample, as opposed to the well-cited assumption of (N/2)
Digital Signal Processing: Principles, Algorithms, and Applications
This paper presents a meta-analysis of the Z-Transform and its application to the Analysis of LTI Systems, and its properties and applications, as well as some of the algorithms used in this analysis.
On the use of windows for harmonic analysis with the discrete Fourier transform
  • F. Harris
  • Computer Science
    Proceedings of the IEEE
  • 1978
A comprehensive catalog of data windows along with their significant performance parameters from which the different windows can be compared is included, and an example demonstrates the use and value of windows to resolve closely spaced harmonic signals characterized by large differences in amplitude.
An update to the sliding DFT
Those properties allow us to create Table 1, listing the appropriate arctan approximation based on the octant location of complex x. So we have to check the signs of Q and I, and see if |Q | > |I |,
Efficient dual-tone multifrequency detection using the nonuniform discrete Fourier transform
Using the new algorithm, a single fixed-point DSP can perform ITU-compliant DTMF detection on the 24 telephone channels of a T1 time-division multiple multiplexed telecommunications line.
Theory and Application of Digital Signal Processing
In this well-written book, Bellman and Wing have indeed accomplished the task of introducing the simplicity of the invariant imbedding method to tackle various problems of interest to engineers, physicists, applied mathematicians, and numerical analysts.
Some windows with very good sidelobe behavior
Correct plots of Harris' windows are presented and additional windows with very good sidelobes and optimal behavior under several different constraints are derived.
Efficient dualtone multi-frequency detection using the non-uniform discrete Fourier transform
  • IEEE Signal Processing Lett
  • 1998