On the advantages of the LMS spectrum analyzer over nonadaptive implementations of the sliding-DFT

Author

Beaufays, FranGoise ; Widrow, Bemard

Author_Institution

Dept. of Electr. Eng., Stanford Univ., CA, USA

Volume

42

Issue

4

fYear

1995

fDate

4/1/1995 12:00:00 AM

Firstpage

218

Lastpage

220

Abstract

Based on the least mean squares (LMS) algorithm, the LMS spectrum analyzer can be used to recursively calculate the discrete Fourier transform (DFT) of a sliding window of data. In this paper, we compare the LMS spectrum analyzer with the straightforward nonadaptive implementation of the recursive DFT. In particular, we demonstrate the robustness of the LMS spectrum analyzer to the propagation of roundoff errors, a property that is not shared by other recursive DFT algorithms

Keywords

discrete Fourier transforms; iterative methods; least mean squares methods; roundoff errors; signal processing; spectral analysers; DFT; LMS spectrum analyzer; discrete Fourier transform; least mean squares algorithm; nonadaptive implementation; nonadaptive implementations; recursive DFT; robustness; roundoff errors; sliding window of data; sliding-DFT; Automatic control; Control system synthesis; Control systems; Discrete Fourier transforms; Least squares approximation; Modems; Network synthesis; Polynomials; Signal processing algorithms; Spectral analysis;

fLanguage

English

Journal_Title

Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on

Publisher

ieee

ISSN

1057-7122

Type

jour

DOI

10.1109/81.382476

Filename

382476