2014
DOI: 10.1007/s00034-014-9923-1
|View full text |Cite
|
Sign up to set email alerts
|

Clipped LMS/RLS Adaptive Algorithms: Analytical Evaluation and Performance Comparison with Low-Complexity Counterparts

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(6 citation statements)
references
References 19 publications
0
6
0
Order By: Relevance
“…Therefore, let us assume in the following that a different equalization factor, β k , is desired for each sensor in Figure 2, where the "LMS" block performs the MEFxLMS algorithm. This algorithm selection is not exclusive, so different, and generally more complex, alternative adaptive strategies could be explored, as the recently proposed Recursive Least Squares based Model Predictive Control (RLSMPC) [36] or noiserobust low complexity adaptive schemes like described in [37], [38]. The system needs to know all the pseudo-error noise signals and all the signals that result from filtering the in-phase and quadrature components of the reference signal through their corresponding estimated frequency response of the secondary paths, C jk .…”
Section: Multi-channel Ane For Single-frequency Noisementioning
confidence: 99%
“…Therefore, let us assume in the following that a different equalization factor, β k , is desired for each sensor in Figure 2, where the "LMS" block performs the MEFxLMS algorithm. This algorithm selection is not exclusive, so different, and generally more complex, alternative adaptive strategies could be explored, as the recently proposed Recursive Least Squares based Model Predictive Control (RLSMPC) [36] or noiserobust low complexity adaptive schemes like described in [37], [38]. The system needs to know all the pseudo-error noise signals and all the signals that result from filtering the in-phase and quadrature components of the reference signal through their corresponding estimated frequency response of the secondary paths, C jk .…”
Section: Multi-channel Ane For Single-frequency Noisementioning
confidence: 99%
“…Recently, there have been many research attempts to improve computational efficiency for RLS [5]- [11], [38]. In [5], [6], a computationally efficient RLS algorithm was developed by extending the idea of Kronecker product decomposition proposed in [39].…”
Section: Low Complexity/precision For Rlsmentioning
confidence: 99%
“…In [11], a variation of RLS algorithm having computational complexity from N 2 /2 to 5N 2 /6 was presented, but the algorithm was not suitable for lower precision fixed point arithmetic due to the accumulation of rounding errors. In [38], the clipped LMS and RLS algorithms, that quantise the input signals to {−1, 0, 1}, were evaluated in terms of accuracy and computational complexity, compared to other low-complexity RLS algorithm counterparts such as the signed regressor RLS, the M Max tap-selection RLS, and the original RLS. Based on the evaluations, the optimal step sizes and forgetting factors for the clipped LMS and RLS that minimise the weight misalignment were derived.…”
Section: Low Complexity/precision For Rlsmentioning
confidence: 99%
“…Inserting (26) into (24) and rearranging terms, and taking the weighted Euclidean norms on both sides, the energy conservation relation of the VC-VS-APMCCA can be established as follow: (27) where w(k + 1) 2 denotes the weighted squared norm w T (k + 1) w(k + 1). By combining the expressions (25) and (27) yields (k)e(k).…”
Section: Performance Analysismentioning
confidence: 99%
“…During the past two decades, several approaches were developed for performance improvement in the presence of impulsive noise [22]- [24]. The sign algorithm and clipped algorithm were proposed for stable performance when large outliers exist in the system [25], [26]. However, they suffer from slow convergence rate.…”
Section: Introductionmentioning
confidence: 99%