• DocumentCode
    1312815
  • Title

    Accurate, Guaranteed Stable, Sliding Discrete Fourier Transform [DSP Tips & Tricks]

  • Author

    Duda, Krzysztof

  • Author_Institution
    Dept. of Meas. & Instrum., AGH Univ. of Sci. & Technol., Kraków, Poland
  • Volume
    27
  • Issue
    6
  • fYear
    2010
  • Firstpage
    124
  • Lastpage
    127
  • Abstract
    This article presented a novel method of computing the SDFT that we call the modulated SDFT (mSDFT). The sliding discrete Fourier transform (SDFT) is a recursive algorithm that computes a DFT on a sample-by-sample basis. The accumulated errors and potential instabilities inherent in traditional SDFT algorithms are drastically reduced in the mSDFT. We removed the twiddle factor from the feedback in a traditional SDFT resonator and thus the finite precision of its representation is no longer a problem.
  • Keywords
    discrete Fourier transforms; signal processing; mSDFT; modulated SDFT; recursive algorithm; sliding discrete Fourier transform; twiddle factor; Accuracy; Approximation algorithms; Digital signal processing; Discrete Fourier transforms; Equations; Signal processing algorithms;
  • fLanguage
    English
  • Journal_Title
    Signal Processing Magazine, IEEE
  • Publisher
    ieee
  • ISSN
    1053-5888
  • Type

    jour

  • DOI
    10.1109/MSP.2010.938088
  • Filename
    5563098