While the LMS algorithm and its normalized version (NLMS), have been thoroughly used and studied. Connections between the Kalman filter and the RLS algorithm have been established however, the connection between the Kalman filter and the LMS algorithm has not received much attention. By linking these two algorithms, a new normalized Kalman based LMS (KLMS) algorithm can be derived that has some advantages to the classical one. Their stability is guaranteed since they are a special case of the Kalman filter. More, they suggests a new way to control the step size, that results in good convergence properties for a large range of input signal powers, that occur in many applications. They prevent high measurement noise sensitivity that may occur in the NLMS algorithm for low order filters, like the ones used in OFDM equalization systems. In these paper, different algorithms based on the correlation form, information form and simplified versions of these are presented. The simplified form maintain the good convergence properties of the KLMS with slightly lower computational complexity.
[1]
Petros G. Voulgaris,et al.
On optimal ℓ∞ to ℓ∞ filtering
,
1995,
Autom..
[2]
J.A.C. Bingham,et al.
Multicarrier modulation for data transmission: an idea whose time has come
,
1990,
IEEE Communications Magazine.
[3]
J. Homer.
Quantifying the convergence speed of LMS adaptive FIR filter with autoregressive inputs
,
2000
.
[4]
T. Kailath,et al.
A state-space approach to adaptive RLS filtering
,
1994,
IEEE Signal Processing Magazine.
[5]
S. Haykin,et al.
Adaptive Filter Theory
,
1986
.
[6]
Hideaki Sakai,et al.
Convergence analysis of a complex LMS algorithm with tonal reference signals
,
2005,
IEEE Transactions on Speech and Audio Processing.
[7]
Huijuan Cui,et al.
Modifier formula on mean square convergence of LMS algorithm
,
2002
.