Name
Title | ||
|---|---|---|
Bias-compensated affine-projection-like algorithm based on maximum correntropy criterion for robust filtering |
Abstract | ||
|---|---|---|
This article proposes an affine-projection-like maximum correntropy (APLMC) algorithm for robust adaptive filtering. The proposed APLMC algorithm is derived by using the objective function based on the maximum correntropy criterion (MCC), which can availably suppress the bad effects of impulsive noise on filter weight updates. But the overall performance of the APLMC algorithm may be decreased when the input signal is polluted by noise. To compensate for the deviation of the APLMC algorithm in the input noise interference environment, the bias compensation (BC) method is introduced. Therefore, the bias-compensated APLMC (BC-APLMC) algorithm is presented. Besides, the convergence of the BC-APLMC algorithm in the mean and the mean square sense is studied, which provides a constraint range for the step-size. Computer simulation results show that the APLMC, and BC-APLMC algorithms are valid in acoustic echo cancellation and system identification applications. It also shows that the proposed algorithms are robust in the presence of input noise and impulse noise. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1016/j.jfranklin.2021.12.018 | Journal of the Franklin Institute |
DocType | Volume | Issue |
Journal | 359 | 3 |
ISSN | Citations | PageRank |
0016-0032 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Haiquan Zhao | 1 | 0 | 0.34 |
| Wang Xiang | 2 | 0 | 0.34 |
| Xiaoqiong He | 3 | 0 | 0.34 |