2016
DOI: 10.1016/j.sigpro.2015.09.015
|View full text |Cite
|
Sign up to set email alerts
|

A new efficient filtered-x affine projection sign algorithm for active control of impulsive noise

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
2
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 15 publications
(4 citation statements)
references
References 28 publications
0
2
0
Order By: Relevance
“…The parameter Pr was set to 0.001 as in [13] to match the average power of a BG process to the background noise. We evaluated the convergence performance in terms of normalized misalignment, which was used in [13], 10 log 10 E || ŵ(k) − w(k)|| 2 2 /E || ŵ(k)|| 2 2 , and ensemble averaging over 100 independent trials. We considered the fully-modeling condition where the length of the adaptive filter has the same number of taps as the unknown filter.…”
Section: Analysis Of Computational Complexity In Implementationmentioning
confidence: 99%
See 1 more Smart Citation
“…The parameter Pr was set to 0.001 as in [13] to match the average power of a BG process to the background noise. We evaluated the convergence performance in terms of normalized misalignment, which was used in [13], 10 log 10 E || ŵ(k) − w(k)|| 2 2 /E || ŵ(k)|| 2 2 , and ensemble averaging over 100 independent trials. We considered the fully-modeling condition where the length of the adaptive filter has the same number of taps as the unknown filter.…”
Section: Analysis Of Computational Complexity In Implementationmentioning
confidence: 99%
“…Introduction: Real-world adaptive filtering applications suffer severe impairments from background and impulsive noises, causing filter coefficient instability or divergence [1][2][3][4][5]. To mitigate impulsive interference, the sign algorithms (SA) and normalized SA (NSA) are used, which can be implemented as additional sign operations to the least-mean-square (LMS) and normalized LMS (NLMS) algorithms, respectively.…”
mentioning
confidence: 99%
“…The graphics processing units (GPUs) offer powerful parallel processing and it also has reduced computational demand in the previous studies [6,306]. Some algorithms for reducing complexity can also be integrated into the classic ANC algorithm, such as fast algorithms, set-membership filtering and PU, moreover, the PU scheme has been applied to modify the FxLMS and FxAP algorithm [199,307]. Note that the first attempt to simultaneously apply PU and setmembership approaches in ANC algorithms is presented for a NLANC system, but not for a linear system [308].…”
Section: Berkhoffmentioning
confidence: 99%
“…The above mentioned algorithms are also challenged by the difficulty of converging in the presence of impulsive noise. A simple, yet effective approach for AINC was proposed in [199], which is derived by introducing the efficient AP sign (APS) algorithm into ANC systems, resulting in the FxAPS algorithm. Additionally, two extensions regarding a VSS scheme and partial update (PU)…”
Section: ) Fxap-based Algorithms For Impulsive Noisementioning
confidence: 99%