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

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. >