Wentao Ma, Lihong Qiu, Peng Guo, Yiming Lei, Chenyu Wang
{"title":"基于比例更新机制的递归MCC鲁棒稀疏系统辨识算法","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":"{\"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}","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}
Recursive MCC Algorithm with Proportionate Update Mechanism for Robust Sparse System Identification
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.