A theoretical analysis of the median LMF adaptive algorithm

Tommy Kristensen Bysted; C. Rusu

doi:10.1109/ICECS.1999.813198

A theoretical analysis of the median LMF adaptive algorithm

Tommy Kristensen Bysted
, C. Rusu

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

936 Downloads (Orbit)

Abstract

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.

Original language	English
Title of host publication	The 6th IEEE International Conference on Electronics, Circuits and Systems, 1999. Proceedings of ICECS '99.
Volume	2
Publisher	IEEE
Publication date	1999
Pages	671-674
ISBN (Print)	0-7803-5682-9
DOIs	https://doi.org/10.1109/ICECS.1999.813198
Publication status	Published - 1999
Event	1999 IEEE 6th International Conference on Electronics, Circuits and Systems - Pafos, Cyprus Duration: 5 Sept 1999 → 8 Sept 1999 Conference number: 6 https://ieeexplore.ieee.org/xpl/conhome/6565/proceeding

Conference

Conference	1999 IEEE 6th International Conference on Electronics, Circuits and Systems
Number	6
Country/Territory	Cyprus
City	Pafos
Period	05/09/1999 → 08/09/1999
Internet address	https://ieeexplore.ieee.org/xpl/conhome/6565/proceeding

Bibliographical note

Copyright 1999 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

Access to Document

10.1109/ICECS.1999.813198

Full textFinal published version, 337 KB

OpenUrl availability

Check availability in DTU Findit

Cite this

@inproceedings{4c0fd531f5854833b9068d84dbd7fa7c,

title = "A theoretical analysis of the median LMF adaptive algorithm",

abstract = "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.",

author = "Bysted, \{Tommy Kristensen\} and C. Rusu",

note = "Copyright 1999 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.; 1999 IEEE 6th International Conference on Electronics, Circuits and Systems, ICECS 1999 ; Conference date: 05-09-1999 Through 08-09-1999",

year = "1999",

doi = "10.1109/ICECS.1999.813198",

language = "English",

isbn = "0-7803-5682-9",

volume = "2",

pages = "671--674",

booktitle = "The 6th IEEE International Conference on Electronics, Circuits and Systems, 1999. Proceedings of ICECS '99.",

publisher = "IEEE",

address = "United States",

url = "https://ieeexplore.ieee.org/xpl/conhome/6565/proceeding",

}

Bysted, TK & Rusu, C 1999, A theoretical analysis of the median LMF adaptive algorithm. in The 6th IEEE International Conference on Electronics, Circuits and Systems, 1999. Proceedings of ICECS '99.. vol. 2, IEEE, pp. 671-674, 1999 IEEE 6th International Conference on Electronics, Circuits and Systems, Pafos, Cyprus, 05/09/1999. https://doi.org/10.1109/ICECS.1999.813198

TY - GEN

T1 - A theoretical analysis of the median LMF adaptive algorithm

AU - Bysted, Tommy Kristensen

AU - Rusu, C.

N1 - Conference code: 6

PY - 1999

Y1 - 1999

N2 - 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.

AB - 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.

U2 - 10.1109/ICECS.1999.813198

DO - 10.1109/ICECS.1999.813198

M3 - Article in proceedings

SN - 0-7803-5682-9

VL - 2

SP - 671

EP - 674

BT - The 6th IEEE International Conference on Electronics, Circuits and Systems, 1999. Proceedings of ICECS '99.

PB - IEEE

T2 - 1999 IEEE 6th International Conference on Electronics, Circuits and Systems

Y2 - 5 September 1999 through 8 September 1999

ER -

A theoretical analysis of the median LMF adaptive algorithm

Abstract

Conference

Bibliographical note

Access to Document

OpenUrl availability

Fingerprint

Cite this