Higher order adaptive algorithms are sensitive to impulse interference. In the case of the LMF (Least Mean Fourth), an easy and effective way to reduce this is to median filter the instantaneous gradient of the LMF algorithm. Although previous published simulations have indicated that this reduces the speed of convergence, no analytical studies have yet been made to prove this. In order to enhance the usability, this paper presents a convergence and steady-state analysis of the median LMF adaptive algorithm. As expected this proves that the median LMF has a slower convergence and a lower steady-state error compared to the LMF.
|Title of host publication||The 6th IEEE International Conference on Electronics, Circuits and Systems, 1999. Proceedings of ICECS '99.|
|Publication status||Published - 1999|
|Event||The 6th IEEE International Conference on Electronics, Circuits and Systems - |
Duration: 1 Jan 1999 → …
|Conference||The 6th IEEE International Conference on Electronics, Circuits and Systems|
|Period||01/01/1999 → …|