2003
DOI: 10.1109/lawp.2003.811322
|View full text |Cite
|
Sign up to set email alerts
|

Adaptive eigen-projection beamforming algorithms for 1D and 2D antenna arrays

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2010
2010
2024
2024

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 22 publications
(4 citation statements)
references
References 7 publications
0
4
0
Order By: Relevance
“…To reduce the implementation complexity, the optimization problem (1) can be converted into an unconstrained one, leading to the well-known GSC. The weight vector is computed by (2) where is the quiescent filter, which is matched to the desired signal spatial signature, is an weight vector updated through an adaptive algorithm [1], [11], and is an blocking matrix such that and , where is an appropriate-sized identity matrix. Although GSC enjoys many advantages from some practical perspectives, it is still subject to the performance tradeoff between the convergence rate and the steady-state SINR output.…”
Section: Problem Formulationmentioning
confidence: 99%
See 1 more Smart Citation
“…To reduce the implementation complexity, the optimization problem (1) can be converted into an unconstrained one, leading to the well-known GSC. The weight vector is computed by (2) where is the quiescent filter, which is matched to the desired signal spatial signature, is an weight vector updated through an adaptive algorithm [1], [11], and is an blocking matrix such that and , where is an appropriate-sized identity matrix. Although GSC enjoys many advantages from some practical perspectives, it is still subject to the performance tradeoff between the convergence rate and the steady-state SINR output.…”
Section: Problem Formulationmentioning
confidence: 99%
“…Although some works have been concentrated on improving the adaptive algorithms [2], [3], a challenging problem remains unsolved by conventional techniques that there is a tradeoff between the convergence speed and the performance at the steady state.…”
Section: Introductionmentioning
confidence: 99%
“…In these techniques, robustness to steering vector uncertainty is increased at the expense of a reduction in noise and interference suppression. Recently, some developments based on worst-case performance optimization [17,18] and subspace projection [19][20][21][22] were proposed. The worst-case approaches ensure that the response of the beamformer is above a given level for all steering vectors whose distance to the presumed steering vector is less than a certain distance.…”
Section: Introductionmentioning
confidence: 99%
“…Spanias and Foutz [6] developed algorithms that involve eigenspace projections in select sub-spaces. These are enhanced 1-D and 2-D [13] versions of the eigenspace projection algorithm [7] developed originally for system identification. Basically, the projections of the gradient algorithm in different subspaces allow the use of distinct step sizes that have the ability to control the convergence speed in each sub-space.…”
Section: Introductionmentioning
confidence: 99%