Constrained maximum correntropy adaptive filtering

doi:10.1016/j.sigpro.2017.05.009

Constrained maximum correntropy adaptive filtering

2017-11-01

76

OA

AI

DOI：10.1016/j.sigpro.2017.05.009

Original

Save

View PDF

Abstract

En 中文

Constrained adaptive filtering algorithms have been extensively studied in many applications. Most existing constrained adaptive filtering algorithms are developed under the mean square error (MSE) criterion, which is an ideal optimality criterion under Gaussian noises. This assumption however fails to model the behavior of non-Gaussian noises found in practice. Motivated by the robustness and simplicity of maximum correntropy criterion (MCC) for non-Gaussian impulsive noises, this paper proposes a new adaptive filtering algorithm called constrained maximum correntropy criterion (CMCC). Specifically, CMCC incorporates a linear constraint into a MCC filter to solve a constrained optimization problem explicitly. The proposed adaptive filtering algorithm is easy to implement, has low computational complexity, and can significantly outperform those MSE based constrained adaptive algorithms in heavy-tailed impulsive noises. Additionally, the mean square convergence behaviors are studied under energy conservation relation, and a sufficient condition to ensure the mean square convergence and the steady-state mean square deviation (MSD) of the CMCC algorithm are obtained. Simulation results confirm the theoretical predictions under both Gaussian and non-Gaussian noises, and demonstrate the excellent performance of the novel algorithm by comparing it with other conventional methods. (C) 2017 Elsevier B.V. All rights reserved.

Keywords:

Constrained adaptive filtering

Maximum correntropy criterion

Non-Gaussian signal processing

Convergence analysis

Constrained maximum correntropy adaptive filtering

Abstract

AI Summary

Journal

Organization