1989
DOI: 10.1109/31.92880
|View full text |Cite
|
Sign up to set email alerts
|

The use of orthogonal transforms for improving performance of adaptive filters

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
60
0
2

Year Published

1993
1993
2013
2013

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 156 publications
(62 citation statements)
references
References 10 publications
0
60
0
2
Order By: Relevance
“…Here, the input signal is assumed real and it is practically convenient for implementation purposes to utilize a real-valued orthogonal transform T [12]. The output error of the TD system is given by…”
Section: Algorithm Formulationmentioning
confidence: 99%
See 1 more Smart Citation
“…Here, the input signal is assumed real and it is practically convenient for implementation purposes to utilize a real-valued orthogonal transform T [12]. The output error of the TD system is given by…”
Section: Algorithm Formulationmentioning
confidence: 99%
“…The TDLMS algorithm attempts to decorrelate the input signal where gains in convergence speed are obtained only after power normalization of the transformed input vector is applied to reduce the eigenvalue disparity of the transformed signal autocorrelation matrix [13], [10], [12], [2]. The optimal transform, known as the Karhunen-Loeve transform (KLT), can completely diagonalize the algorithm autocorrelation matrix but, unfortunately, is signal dependent and computationally prohibitive.…”
Section: Introductionmentioning
confidence: 99%
“…In both cases, the orthogonal transform is used as a means for decomposing the input signal into approximately decorrelated components [5]- [7]. Moreover, in both approaches, the variables that are explicitly adapted are the transform domain coefficients of the adaptive filter.…”
Section: Classical Approaches Using a Square Orthogonal Transformmentioning
confidence: 99%
“…Driven by the practical advantages of the TDNLMS family, there is also considerable interest in the performance analysis of these algorithms [8,9]. Results concerning the performance behaviors of the TDNLMS algorithm were studied in [6][7][8][9][10][11].…”
Section: Introductionmentioning
confidence: 99%
“…An important class of NLMS is the transform domain NLMS (TDNLMS) algorithms [6][7][8][9][10][11] where unitary transformations such as the discrete Fourier transform (DFT), the discrete cosine transform (DCT), and the wavelet transform (WT) are employed to pre-whiten the input signal. Prewhitening and element-wise normalization usually help to reduce the eigenvalue spread of the input autocorrelation matrix and hence significantly improve the convergence speed.…”
Section: Introductionmentioning
confidence: 99%