A Recursive Least M-Estimate Adaptive Algorithm With Low Complexity for Active Control of Impulsive Noises

Miaomiao Wang, Hongsen He, Jingdong Chen, Jacob Benesty, Yi Yu

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Adaptive active control is a crucial technology to attenuate impulsive noises. But how to design an appropriate adaptive filter to attain a flexible compromise between noise reduction and computational complexity is a challenging problem. This paper proposes a robust adaptive filtering algorithm to deal with this issue. The coefficient vector of the adaptive filter is decomposed into two sets of short sub-filters through the Kronecker product, which reduces the size of matrices and vectors in the active noise control algorithm. A robust estimator, which is insensitive to impulsive noises, is used to define a group of cost function under the recursive least-squares criterion, based on which we derive the adaptive control algorithm that is composed of two groups of alternately updating equations. The effectiveness of the proposed approach is verified by numerical simulations.

Original languageEnglish
Title of host publication31st European Signal Processing Conference, EUSIPCO 2023 - Proceedings
PublisherEuropean Signal Processing Conference, EUSIPCO
Pages371-375
Number of pages5
ISBN (Electronic)9789464593600
DOIs
StatePublished - 2023
Event31st European Signal Processing Conference, EUSIPCO 2023 - Helsinki, Finland
Duration: 4 Sep 20238 Sep 2023

Publication series

NameEuropean Signal Processing Conference
ISSN (Print)2219-5491

Conference

Conference31st European Signal Processing Conference, EUSIPCO 2023
Country/TerritoryFinland
CityHelsinki
Period4/09/238/09/23

Keywords

  • Adaptive active control
  • computational complexity
  • impulsive noise
  • Kronecker product decomposition

Fingerprint

Dive into the research topics of 'A Recursive Least M-Estimate Adaptive Algorithm With Low Complexity for Active Control of Impulsive Noises'. Together they form a unique fingerprint.

Cite this