IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i9p1310-d1382966.html
   My bibliography  Save this article

Robust Bias Compensation Method for Sparse Normalized Quasi-Newton Least-Mean with Variable Mixing-Norm Adaptive Filtering

Author

Listed:
  • Ying-Ren Chien

    (Department of Electrical Engineering, National Ilan University, Yilan 260007, Taiwan)

  • Han-En Hsieh

    (Department of Electrical Engineering, National Ilan University, Yilan 260007, Taiwan)

  • Guobing Qian

    (College of Electronic and Information Engineering, Southwest University, Chongqing 400715, China)

Abstract

Input noise causes inescapable bias to the weight vectors of the adaptive filters during the adaptation processes. Moreover, the impulse noise at the output of the unknown systems can prevent bias compensation from converging. This paper presents a robust bias compensation method for a sparse normalized quasi-Newton least-mean (BC-SNQNLM) adaptive filtering algorithm to address these issues. We have mathematically derived the biased-compensation terms in an impulse noisy environment. Inspired by the convex combination of adaptive filters’ step sizes, we propose a novel variable mixing-norm method, BC-SNQNLM-VMN, to accelerate the convergence of our BC-SNQNLM algorithm. Simulation results confirm that the proposed method significantly outperforms other comparative works regarding normalized mean-squared deviation (NMSD) in the steady state.

Suggested Citation

  • Ying-Ren Chien & Han-En Hsieh & Guobing Qian, 2024. "Robust Bias Compensation Method for Sparse Normalized Quasi-Newton Least-Mean with Variable Mixing-Norm Adaptive Filtering," Mathematics, MDPI, vol. 12(9), pages 1-17, April.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:9:p:1310-:d:1382966
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/9/1310/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/9/1310/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Inam ur Rehman & Hasan Raza & Nauman Razzaq & Jaroslav Frnda & Tahir Zaidi & Waseem Abbasi & Muhammad Shahid Anwar, 2023. "A Computationally Efficient Distributed Framework for a State Space Adaptive Filter for the Removal of PLI from Cardiac Signals," Mathematics, MDPI, vol. 11(2), pages 1-21, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      Corrections

      All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:12:y:2024:i:9:p:1310-:d:1382966. See general information about how to correct material in RePEc.

      If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

      If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

      For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

      Please note that corrections may take a couple of weeks to filter through the various RePEc services.

      IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.