On the Steady State Performance of Frequency Domain LMS Algorithms
Loading...
Authors
Feuer, Arie
Cristi, Roberto
Subjects
Advisors
Date of Issue
1993
Date
Publisher
Language
Abstract
The use of the fast Fourier transform (FFT) in the implementation
of the least mean square (LMS) algorithm in the frequency domain results in several types of algorithms, two of which can be
classified as constrained and unconstrained. In this correspondence,
we point out that, in general, especially with correlated data, the unconstrained
algorithm may have a significant performance advantage
in steady state if block mean square error is the criterion. Furthermore,
we point out here that, in the constrained algorithms, the choice
of different step sizes in different frequency bins (as is commonly done)
will very likely result in a deterioration of steady state performance.
This does not happen in the unconstrained algorithm.
Type
Article
Description
Series/Report No
Department
Electrical and Computer Engineering
Organization
Identifiers
NPS Report Number
Sponsors
Funder
Format
Citation
IEEE Transactions on Signal Processing, Vol. 41, No. 1, January 1993.
Distribution Statement
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.