Combined LMS / F algorithm

A new adaptive lter algorithm has been developed that combines the beneets of the Least Mean Square (LMS) and Least Mean Fourth (LMF) methods. This algorithm , called LMS/F, outperforms the standard LMS algorithm judging either constant convergence rate or constant misadjustment. While LMF outperforms LMS for certain noise prooles, its stability cannot be guaranteed for known input signals even for very small step sizes. However, both LMS and LMS/F have good stability properties and LMS/F only adds a few more computations per iteration compared to LMS. Simulations of a nonstationary system identiication problem demonstrate the performance beneets of the LMS/F algorithm.

[1]  A. Constantinides,et al.  Least mean mixed-norm adaptive filtering , 1994 .

[2]  M.A. Webster,et al.  A gradient-based variable step-size LMS algorithm , 1991, IEEE Proceedings of the SOUTHEASTCON '91.

[3]  Richard W. Harris,et al.  A variable step (VS) adaptive filter algorithm , 1986, IEEE Trans. Acoust. Speech Signal Process..

[4]  S. Thomas Alexander,et al.  Adaptive Signal Processing , 1986, Texts and Monographs in Computer Science.

[5]  Bernard Widrow,et al.  The least mean fourth (LMF) adaptive algorithm and its family , 1984, IEEE Trans. Inf. Theory.

[6]  Electronics Letters , 1965, Nature.