• DocumentCode
    1197431
  • Title

    Fundamental relations between the LMS algorithm and the DFT

  • Author

    Widrow, Bernard ; Baudrenghien, Philippe ; Vetterli, Martin ; Titchener, Paul F.

  • Volume
    34
  • Issue
    7
  • fYear
    1987
  • fDate
    7/1/1987 12:00:00 AM
  • Firstpage
    814
  • Lastpage
    820
  • Abstract
    The digital Fourier transform (DFT) and the adaptive least mean square (LMS) algorithm have existed for some time. This paper establishes a connection between them. The result is the "LMS spectrum analyzer," a new means for the calculation of the DFT. The method uses a set of N periodic complex phasors whose frequencies are equally spaced from dc to the sampling frequency. The phasors are weighted and then are summed to generate a reconstructed signal. Weights are adapted to realize a best least squares fit between this reconstructed signal and the input signal whose spectrum is to be estimated. The magnitude squares of the weights correspond to the power spectrum. For a proper choice of adaptation speed, the LMS spectrum analyzer will provide an exact N -sample DFT. New DFT outputs will be available in steady flow after the introduction of each new data sample.
  • Keywords
    Adaptive algorithms; DFT; Discrete Fourier transforms (DFT´s); Least-squares approximation; Adaptive algorithm; Concurrent computing; Discrete Fourier transforms; Fourier transforms; Frequency; Least squares approximation; Sampling methods; Signal generators; Signal sampling; Spectral analysis;
  • fLanguage
    English
  • Journal_Title
    Circuits and Systems, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0098-4094
  • Type

    jour

  • DOI
    10.1109/TCS.1987.1086208
  • Filename
    1086208