Robust diffusion maximum correntropy criterion algorithm for distributed network estimation

نویسندگان

  • Wentao Ma
  • Hua Qu
  • Badong Chen
  • Ji-hong Zhao
  • Jiandong Duan
چکیده

Robust diffusion algorithms based on the maximum correntropy criterion(MCC) are developed to address the distributed networks estimation issue in impulsive(long-tailed) noise environments. The cost functions used in distributed network estimation are in general based on the mean square error (MSE) criterion, which is optimal only when the measurement noise is Gaussian. In non-Gaussian situations, such as the impulsive-noise case, MCC based method may achieve a much better performance than the MSE methods since it takes into account higher order statistics of error distribution. The proposed methods can also outperform the robust diffusion least mean p-power(DLMP) and diffusion minimum error entropy (DMEE) algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximum correntropy criterion based sparse adaptive filtering algorithms for robust channel estimation under non-Gaussian environments

Sparse adaptive channel estimation problem is one of the most important topics in broadband wireless communications systems due to its simplicity and robustness. So far many sparsity-aware channel estimation algorithms have been developed based on the well-known minimum mean square error (MMSE) criterion, such as the zero-attracting least mean square (ZALMS),which are robust under Gaussian assu...

متن کامل

A Robust Distributed Estimation Algorithm under Alpha-Stable Noise Condition

Robust adaptive estimation of unknown parameter has been an important issue in recent years for reliable operation in the distributed networks. The conventional adaptive estimation algorithms that rely on mean square error (MSE) criterion exhibit good performance in the presence of Gaussian noise, but their performance drastically decreases under impulsive noise. In this paper, we propose a rob...

متن کامل

Recursive Generalized Maximum Correntropy Criterion Algorithm with Sparse Penalty Constraints for System Identification

To address sparse system identification problem in non-Gaussian impulsive noise environment, the recursive generalized maximum correntropy criterion (RGMCC) algorithm with sparse penalty constraints is proposed to combat impulsive-inducing instability. Specifically, a recursive algorithm based on the generalized correntropy with a forgetting factor of error is developed to improve the performan...

متن کامل

Sparsity-Aware Recursive Maximum Correntropy Criteria Adaptive Filtering Algorithm

To address sparse channel estimation problem in nonGaussian impulsive noise environment, a recursive maximum correntropy criteria (RMCC) algorithm using sparse constraint is proposed to combat impulsive-inducing instability. Specifically, the recursive algorithm on the correntrioy with a forgetting factor of error at iteration is to solve steady-state error for improving the maximum correntropy...

متن کامل

Maximum Total Correntropy Diffusion Adaptation over Networks with Noisy Links

Distributed estimation over networks draws much attraction in recent years. In many situations, due to imperfect information communication among nodes, the performance of traditional diffusion adaptive algorithms such as the diffusion LMS (DLMS) may degrade. To deal with this problem, several modified DLMS algorithms have been proposed. However, these DLMS based algorithms still suffer from bia...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1508.01903  شماره 

صفحات  -

تاریخ انتشار 2015