2013
DOI: 10.1002/acs.2423
|View full text |Cite
|
Sign up to set email alerts
|

A fast convergence normalized least‐mean‐square type algorithm for adaptive filtering

Abstract: A new adaptive algorithm with fast convergence and low complexity is presented. By using the calculation structure of the dual Kalman variables of the fast transversal filter algorithm and a simple decorrelating technique for the input signal, we obtain an algorithm that exhibits faster convergence speed and enhanced tracking ability compared with the normalized least-mean-square algorithm with similar computational complexity.A. BENALLAL AND M. AREZKI CONCLUSIONIn this paper, a new FNLMS-type algorithm for ad… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 21 publications
(3 citation statements)
references
References 6 publications
0
3
0
Order By: Relevance
“…The convex combination of y (a) (n) and y (b) (n) is given by where, ̃( ) is dual Kalman gain [14], γN(n) is the Likelihood variable [14].…”
Section: Signed Convex Combination Of Fast Convergence (Sccfc) Adaptive Algorithmmentioning
confidence: 99%
See 2 more Smart Citations
“…The convex combination of y (a) (n) and y (b) (n) is given by where, ̃( ) is dual Kalman gain [14], γN(n) is the Likelihood variable [14].…”
Section: Signed Convex Combination Of Fast Convergence (Sccfc) Adaptive Algorithmmentioning
confidence: 99%
“…The computational complexity of the LMS [11], NLMS [13], FCNLMS [14], CLMS [16], and the proposed SCCFC algorithms are compared in this section. Here the length of the adaptive algorithm is given by N. For a regular LMS algorithm takes 2N+1 multiplications to update the filter.…”
Section: Computational Complexitymentioning
confidence: 99%
See 1 more Smart Citation