Robustness Analysis of the Data-Selective Volterra NLMS Algorithm

03/25/2020
by   Javad Sharafi, et al.
0

Recently, the data-selective adaptive Volterra filters have been proposed; however, up to now, there are not any theoretical analyses on its behavior rather than numerical simulations. Therefore, in this paper, we analyze the robustness (in the sense of l2-stability) of the data-selective Volterra normalized least-mean-square (DS-VNLMS) algorithm. First, we study the local robustness of this algorithm at any iteration, then we propose a global bound for the error/discrepancy in the coefficient vector. Also, we demonstrate that the DS-VNLMS algorithm improves the parameter estimation for the majority of the iterations that an update is implemented. Moreover, we prove that if the noise bound is known, we can set the DS-VNLMS so that it never degrades the estimate. The simulation results corroborate the validity of the executed analysis and demonstrate that the DS-VNLMS algorithm is robust against noise, no matter how its parameters are adopted.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/15/2019

Cramer-Rao Bound for Estimation After Model Selection and its Application to Sparse Vector Estimation

In many practical parameter estimation problems, such as coefficient est...
research
12/08/2015

Distributed Adaptive LMF Algorithm for Sparse Parameter Estimation in Gaussian Mixture Noise

A distributed adaptive algorithm for estimation of sparse unknown parame...
research
09/06/2019

On Data-Selective Learning

Adaptive filters are applied in several electronic and communication dev...
research
08/25/2016

Transient performance analysis of zero-attracting LMS

Zero-attracting least-mean-square (ZA-LMS) algorithm has been widely use...
research
08/09/2014

RMSE-ELM: Recursive Model based Selective Ensemble of Extreme Learning Machines for Robustness Improvement

Extreme learning machine (ELM) as an emerging branch of shallow networks...
research
12/18/2019

Variants of Partial Update Augmented CLMS Algorithm and Their Performance Analysis

Naturally complex-valued information or those presented in complex domai...
research
05/23/2014

Connection graph Laplacian methods can be made robust to noise

Recently, several data analytic techniques based on connection graph lap...

Please sign up or login with your details

Forgot password? Click here to reset