Title :
Performance study of Set-Membership NLMS algorithm over an adaptive incremental network
Author :
Esfand Abadi, Mohammad Shams ; Eskandari, Hani
Author_Institution :
Fac. of Electr. & Comput. Eng., Shahid Rajaee Teacher Training Univ., Tehran, Iran
fDate :
Oct. 31 2013-Nov. 1 2013
Abstract :
In this paper we apply Set-Membership (SM) adaptive algorithm over distributed networks based on incremental strategy. The distributed SM normalized least mean squares (dSM-NLMS) algorithm is introduced which has high convergence speed, low steady-state mean square error and low computational complexity features. The good performance of dSM-NLMS is demonstrated by several computer simulations in distributed networks.
Keywords :
computational complexity; digital simulation; distributed processing; least mean squares methods; network theory (graphs); SM adaptive algorithm; adaptive incremental network; computational complexity; computer simulations; dSM-NLMS algorithm; distributed SM normalized least mean square algorithm; distributed networks; incremental strategy; set-membership NLMS algorithm; set-membership adaptive algorithm; steady-state mean square error; Adaptive algorithms; Computational complexity; Computers; Convergence; Educational institutions; Least squares approximations; Steady-state; Distributed networks; Incremental strategy; SM-NLMS; adaptive algorithm;
Conference_Titel :
Computer and Knowledge Engineering (ICCKE), 2013 3th International eConference on
Conference_Location :
Mashhad
Print_ISBN :
978-1-4799-2092-1
DOI :
10.1109/ICCKE.2013.6682807
