M-estimate affine projection spline adaptive filtering algorithm: Analysis and implementation

被引:14
|
作者
Yu, Tao [1 ]
Li, Wenqi [1 ]
de Lamare, Rodrigo C. [2 ,3 ]
Yu, Yi [4 ]
机构
[1] Southwest Petr Univ, Sch Elect Engn & Informat, Chengdu 610500, Peoples R China
[2] Pontifical Catholic Univ Rio De Janeiro, Ctr Telecommun Studies CETUC, BR-22451900 Rio De Janeiro, Brazil
[3] Univ York, Dept Elect Engn, York YO10 5DD, N Yorkshire, England
[4] Southwest Univ Sci & Technol, Sch Informat Engn, Robot Technol Used Special Environm Key Lab Sichu, Mianyang 621010, Sichuan, Peoples R China
基金
中国国家自然科学基金;
关键词
Affine projection; Impulsive interference; M-estimate; Nonlinear acoustic echo cancellation; Spline adaptive filtering; PERFORMANCE;
D O I
10.1016/j.dsp.2022.103452
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper investigates the M-estimate affine projection spline adaptive filtering (MAPSAF) algorithm, which utilizes a modified Huber function with robustness against impulsive interference, and employs historical regression data to update the weight and the knot vector estimates for nonlinear filtering tasks. The detailed convergence and steady-state analyses of MAPSAF are also carried out in the mean and mean-square senses. In addition, an improved MAPSAF by exploiting the combined step sizes, called the CSS-MAPSAF algorithm, is derived to speed up the convergence on the premise of low steady-state misalignment. Numerical experiments in nonlinear system identification and nonlinear acoustic echo cancellation problems corroborate the theoretical performance analysis and the superiority of the proposed algorithms. (C)& nbsp;2022 Elsevier Inc. All rights reserved.
引用
收藏
页数:20
相关论文
共 50 条
  • [21] Comments on "A Recursive Least M-Estimate Algorithm for Robust Adaptive Filtering in Impulsive Noise: Fast Algorithm and Convergence Performance Analysis"
    Bershad, Neil J.
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2009, 57 (01) : 388 - 389
  • [22] Robust Diffusion Recursive Least M-Estimate Adaptive Filtering and Its Performance Analysis
    Lv, Shaohui
    Zhao, Haiquan
    CIRCUITS SYSTEMS AND SIGNAL PROCESSING, 2023, 42 (08) : 4929 - 4952
  • [23] Robust kernel recursive adaptive filtering algorithms based on M-estimate
    Yang, Xinyue
    Mu, Yifan
    Cao, Kui
    Lv, Mengzhuo
    Peng, Bei
    Zhang, Ying
    Wang, Gang
    SIGNAL PROCESSING, 2023, 207
  • [24] Robust Diffusion Recursive Least M-Estimate Adaptive Filtering and Its Performance Analysis
    Shaohui Lv
    Haiquan Zhao
    Circuits, Systems, and Signal Processing, 2023, 42 : 4929 - 4952
  • [25] Affine Projection Champernowne Algorithm for Robust Adaptive Filtering
    Kumar, Krishna
    Karthik, M. L. N. S.
    Bhattacharjee, Sankha Subhra
    George, Nithin, V
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2022, 69 (03) : 1947 - 1951
  • [26] An affine projection adaptive filtering algorithm with selective regressors
    Hwang, Kyu-Young
    Song, Woo-Jin
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2007, 54 (01): : 43 - 46
  • [27] Geometric algebra based least mean m-estimate robust adaptive filtering algorithm and its transient performance analysis
    Lv, Shaohui
    Zhao, Haiquan
    He, Xiaoqiong
    SIGNAL PROCESSING, 2021, 189
  • [28] Reply to "Comments on 'A Recursive Least M-Estimate Algorithm for Robust Adaptive Filtering in Impulsive Noise: Fast Algorithm and Convergence Performance Analysis"'
    Chan, S. C.
    Zou, Y. X.
    Zhou, Y.
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2009, 57 (01) : 389 - 389
  • [29] A Robust Least Mean M-estimate Adaptive Filtering Algorithm Based on Geometric Algebra for System Identification
    Lv, Shaohui
    Zhao, Haiquan
    TWELFTH INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING SYSTEMS, 2021, 11719
  • [30] M-Estimate Based Normalized Subband Adaptive Filter Algorithm: Performance Analysis and Improvements
    Yu, Yi
    He, Hongsen
    Chen, Badong
    Li, Jianghui
    Zhang, Youwen
    Lu, Lu
    IEEE-ACM TRANSACTIONS ON AUDIO SPEECH AND LANGUAGE PROCESSING, 2020, 28 : 225 - 239