2000
DOI: 10.1016/s0165-1684(00)00098-0
|View full text |Cite
|
Sign up to set email alerts
|

Performance analysis of the DCT-LMS adaptive filtering algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
32
0
12

Year Published

2005
2005
2020
2020

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 58 publications
(44 citation statements)
references
References 20 publications
0
32
0
12
Order By: Relevance
“…However, it is well known that, depending on the correlation level of the input data (i.e., eigenvalue spread of the input autocorrelation matrix), the LMS algorithm has its convergence rate compromised [1][2][3][4][5]. Aiming to overcome this drawback of the LMS algorithm, different strategies have been proposed and studied in the open literature [2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19]. Such strategies generally lead to better performance at the expense of a substantial increase in the computational load (for details, see [5]).…”
Section: Introductionmentioning
confidence: 99%
See 4 more Smart Citations
“…However, it is well known that, depending on the correlation level of the input data (i.e., eigenvalue spread of the input autocorrelation matrix), the LMS algorithm has its convergence rate compromised [1][2][3][4][5]. Aiming to overcome this drawback of the LMS algorithm, different strategies have been proposed and studied in the open literature [2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19]. Such strategies generally lead to better performance at the expense of a substantial increase in the computational load (for details, see [5]).…”
Section: Introductionmentioning
confidence: 99%
“…[6,8,9,14,26,27]. On the other hand, the analysis of the TDLMS algorithm considering a nonstationary environment (i.e., a timevarying plant) has only been addressed in a few research works [15,25]. In [15], a modified power estimator is used in the TDLMS, leading to a model particularized for such a modified algorithm.…”
Section: Introductionmentioning
confidence: 99%
See 3 more Smart Citations