Recursive MCC Algorithm with Proportionate Update Mechanism for Robust Sparse System Identification

Wentao Ma, Lihong Qiu, Peng Guo, Yiming Lei, Chenyu Wang
{"title":"Recursive MCC Algorithm with Proportionate Update Mechanism for Robust Sparse System Identification","authors":"Wentao Ma, Lihong Qiu, Peng Guo, Yiming Lei, Chenyu Wang","doi":"10.1109/ICEICT55736.2022.9908812","DOIUrl":null,"url":null,"abstract":"This paper proposed an effective robust adaptive filtering algorithm (RAFA) for sparse system identification (SSI) considering impulsive noise interference. Because of the robustness of the correntropy, it has been utilized as a cost, called maximum correntropy criterion (MCC), for designing robust sparse AFA via proportionate update method. However, the original proportionate MCC algorithm has some defects in the initial convergence speed. To address this problem, the proportionate update matrix is inserted into the gain matrix of the recursive MCC algorithm, which takes advantage of both proportionate update method and recursive RAF =A. Therefore, the proposed proportionate recursive MCC (PRMCC) algorithm not only can obtian low steady-state misalignment, but also can show a fast convergence speed for SSI in presence of impulsive noise. Some numerical simulations are performed to test the robustness of the proposed PRMCC method under different conditions, and the simulation results show that it can outperform other outstanding algorithms for SSI in non-Gaussian noise with outliers environments.","PeriodicalId":179327,"journal":{"name":"2022 IEEE 5th International Conference on Electronic Information and Communication Technology (ICEICT)","volume":"451 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 5th International Conference on Electronic Information and Communication Technology (ICEICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEICT55736.2022.9908812","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper proposed an effective robust adaptive filtering algorithm (RAFA) for sparse system identification (SSI) considering impulsive noise interference. Because of the robustness of the correntropy, it has been utilized as a cost, called maximum correntropy criterion (MCC), for designing robust sparse AFA via proportionate update method. However, the original proportionate MCC algorithm has some defects in the initial convergence speed. To address this problem, the proportionate update matrix is inserted into the gain matrix of the recursive MCC algorithm, which takes advantage of both proportionate update method and recursive RAF =A. Therefore, the proposed proportionate recursive MCC (PRMCC) algorithm not only can obtian low steady-state misalignment, but also can show a fast convergence speed for SSI in presence of impulsive noise. Some numerical simulations are performed to test the robustness of the proposed PRMCC method under different conditions, and the simulation results show that it can outperform other outstanding algorithms for SSI in non-Gaussian noise with outliers environments.
基于比例更新机制的递归MCC鲁棒稀疏系统辨识算法
提出了一种有效的鲁棒自适应滤波算法,用于考虑脉冲噪声干扰的稀疏系统识别。由于熵值的鲁棒性,它被作为一种代价,称为最大熵值准则(MCC),用于通过比例更新方法设计鲁棒稀疏AFA。然而,原有的比例MCC算法在初始收敛速度上存在一定的缺陷。为了解决这一问题,将比例更新矩阵插入到递归MCC算法的增益矩阵中,该算法同时利用了比例更新方法和递归RAF =A。因此,所提出的比例递归MCC (PRMCC)算法不仅可以获得低稳态失调,而且在存在脉冲噪声的情况下对SSI具有较快的收敛速度。通过数值仿真验证了该方法在不同条件下的鲁棒性,仿真结果表明,该方法在非高斯噪声和离群值环境下的SSI性能优于其他优秀算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信