Performance comparison of RLS and LMS algorithms for tracking a first order Markov communications channel
- 4 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 266-270 vol.1
- https://doi.org/10.1109/iscas.1990.112009
Abstract
The performances of recursive-least-squares (RLS) and least-mean-square (LMS) adaptive algorithms for tracking a first-order Markov tapped delay line model of a communications channel whose output is observed in a white Gaussian noise background are studied. The model includes the errors due to the finite memory of the channel. A rigorous analytical evaluation of the misadjustment errors of both RLS and LMS is presented. The misadjustment errors are individually minimized over the RLS forgetting factor and the LMS step size. It is shown that the misadjustment factors are nearly equal (RLS is slightly superior) whether the bandwidth of the channel tap fluctuations is greater than or less than the bandwidth of the adaptation algorithm. Conditions are presented for when the adaptation process should be turned off.Keywords
This publication has 5 references indexed in Scilit:
- Performance comparison of RLS and LMS algorithms for tracking a first order Markov communications channelPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Tracking properties and steady-state performance of RLS adaptive filter algorithmsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1986
- Optimization of adaptive identification for time-varying filtersIEEE Transactions on Automatic Control, 1986
- On the statistical efficiency of the LMS algorithm with nonstationary inputsIEEE Transactions on Information Theory, 1984
- Stationary and nonstationary learning characteristics of the LMS adaptive filterProceedings of the IEEE, 1976