DocumentCode :
1230334
Title :
Comments on "Convergence and performance analysis of the normalized LMS algorithm with uncorrelated Gaussian data
Author :
Morgan, D.R.
Author_Institution :
AT&T Bell Lab., Whippany, NJ, USA
Volume :
35
Issue :
6
fYear :
1989
Firstpage :
1299
Abstract :
Noting that a fine analysis is presented for the convergence and misadjustment of the normalized least-mean-square (NLMS) algorithm in the paper by Tarrab and Feuer (see ibid., vol.3, no.4, p.468091, July 1988), the commenter claims that the results and comparisons with the LMS algorithm are not in a form that readily enables the reader to draw practical conclusions. He points out that plotting mean-square error on a linear, instead of logarithmic (dB), scale hides the important detail of the error as it converges to its minimum value, which is exactly the region where the practical engineer requires detailed knowledge to assess performance. Moreover, in the comparison of the NLMS and LMS algorithm convergence rate and misadjustment, the practitioner wants to know how fast the algorithm will converge when the misadjustment is constrained to a specified value.<>
Keywords :
convergence of numerical methods; least squares approximations; signal processing; convergence; misadjustment; normalized LMS algorithm; performance analysis; uncorrelated Gaussian data; Bridges; Convergence; Decoding; Error correction codes; Knowledge engineering; Least squares approximation; Minimax techniques; Performance analysis; Speech processing; Welding;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.45287
Filename :
45287
Link To Document :
بازگشت