期刊
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS
卷 70, 期 3, 页码 1214-1218出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCSII.2022.3218714
关键词
Signal processing algorithms; Filtering algorithms; Array signal processing; Matrices; Computational complexity; Steady-state; Interference; Constrained adaptive filtering; affine-projection-like; M-estimate; impulsive noise; beamforming
In this study, two robust constrained affine-projection-like M-estimate (CAPLM) adaptive filtering algorithms are proposed to address the lack of robustness to impulsive interference in the traditional constrained affine projection (CAP) algorithm and achieve unbiased output in certain applications. The algorithms, CAPLM-I and CAPLM-II, are obtained by defining a modified Huber function (MHF) based robust AP-like (APL) minimization problem with constraints and transforming it into two different unconstrained optimization problems using Lipschitz continuity and two different methods. Both CAPLM algorithms can avoid the computational complexity caused by inverting the input signal matrix in classical AP algorithm and achieve robustness to impulsive interference. The mean square stability and corresponding stable step size ranges are analyzed. Simulation results demonstrate that the proposed CAPLM-I and CAPLM-II algorithms perform well in impulsive noise environments for system identification and beamforming applications, with lower steady-state error and faster convergence speed compared to other algorithms.
In this brief, two robust constrained affine-projection-like M-estimate (CAPLM) adaptive filtering algorithms are proposed, which solve the problem that the traditional constrained affine projection (CAP) algorithm is not robust to impulsive interference, and realize unbiased output in some applications where the desired signal is unavailable or unnecessary. Specifically, a modified Huber function (MHF) based robust AP-like (APL) minimization problem with constraints is defined and can be transformed into two different unconstrained optimization problems by using Lipschitz continuity and two different methods, and then CAPLM-I and CAPLM-II algorithms are obtained respectively. Both CAPLM algorithms can avoid a certain amount of computational complexity caused by the inversion of the input signal matrix in classical AP algorithm, and realize the robustness to impulsive interference. In addition, the mean square stabilities of them are analyzed, and the corresponding stable step size ranges are also given. Simulation results show that the proposed CAPLM-I and CAPLM-II algorithms perform well in system identification and beamforming applications in impulsive noise environment, and provide lower steady-state error and faster convergence speed than other compared algorithms.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据