1996
DOI: 10.1109/78.553469
|View full text |Cite
|
Sign up to set email alerts
|

Low-rank adaptive filters

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
99
0
1

Year Published

2002
2002
2023
2023

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 177 publications
(101 citation statements)
references
References 25 publications
1
99
0
1
Order By: Relevance
“…A reduction in error was obtained once the true dimension of the signal subspace was estimated. Concurrently, extensive research resulted in generalized algorithms for: subspace based blind channel identification (23,1,20,9), equalization (35), data adaptive rank shaping (30), and linear prediction (1) that exploited the reduced rank nature of the signal subspace. These generalized methods are conceptually quite comparable to the types of algorithms that need to be developed to demonstrate the relevance and need for using a channel subspace based approach to solve equivalent problems in UWA communications.…”
Section: Prior Work On Subspace Methodsmentioning
confidence: 99%
“…A reduction in error was obtained once the true dimension of the signal subspace was estimated. Concurrently, extensive research resulted in generalized algorithms for: subspace based blind channel identification (23,1,20,9), equalization (35), data adaptive rank shaping (30), and linear prediction (1) that exploited the reduced rank nature of the signal subspace. These generalized methods are conceptually quite comparable to the types of algorithms that need to be developed to demonstrate the relevance and need for using a channel subspace based approach to solve equivalent problems in UWA communications.…”
Section: Prior Work On Subspace Methodsmentioning
confidence: 99%
“…In the LORAF approach, the order is reduced to [i.e., the complexity required by the updating of the matrix , according to (7)] providing a complexity gain of . Moreover, a more efficient implementation for the QR decomposition, the matrix and updating processes, provides a further computational cost reduction to [5].…”
Section: A Implementation Issuesmentioning
confidence: 99%
“…The forgetting factor defines in fact the effective length of the temporal window used for multiblock averaging. This can be expressed in number of blocks as [5]. Usually, delays are characterized by slow variations over the blocks, calling thereby for large values of (i.e., long memory length) so as to reduce the MSE of the channel estimate.…”
Section: A Implementation Issuesmentioning
confidence: 99%
See 2 more Smart Citations