1974
DOI: 10.1109/taes.1974.307893
|View full text |Cite
|
Sign up to set email alerts
|

Rapid Convergence Rate in Adaptive Arrays

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

12
925
0
12

Year Published

1999
1999
2015
2015

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 1,911 publications
(997 citation statements)
references
References 5 publications
12
925
0
12
Order By: Relevance
“…The SMI method requires K > 2N samples of data to achieve an average loss of less than 3 dB [10] and a matrix inversion operation, inv (), forŵ computation. To enable meaningful comparison to the MIL-MVDR, AV and LMS algorithms, we adopt a moving average (MA) approach to computeR iteratively.…”
Section: The Sample Matrix Inversion Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…The SMI method requires K > 2N samples of data to achieve an average loss of less than 3 dB [10] and a matrix inversion operation, inv (), forŵ computation. To enable meaningful comparison to the MIL-MVDR, AV and LMS algorithms, we adopt a moving average (MA) approach to computeR iteratively.…”
Section: The Sample Matrix Inversion Algorithmmentioning
confidence: 99%
“…The array weights of the MVDR beamformer can be adapted through various algorithms. For example, the Sample Matrix Inversion (SMI) based algorithm is a fast adaptive beamforming/nulling technique because it directly calculates the covariance matrix [10][11][12]. SMI avoids the problem of eigenvalue spread that often limits the convergence rate for close-loop algorithms such as the Least Mean Square (LMS) approach.…”
Section: Introductionmentioning
confidence: 99%
“…One is thatR L is converged (according to [20], if L is large enough, it can be thought true in engineering application); the other is that the moving target is not correlated to the clutter (referring to [11,21], it can be thought so when considering the moving target average effect on different range cells). Because the clutter echoes are random variable, one range cell clutter echo is only once realization of them; the NHD result based on them is a variable too.…”
Section: The Interference Target Detection Algorithm Performance Analmentioning
confidence: 99%
“…It is a candidate technology to improve the detecting and tracking of slow moving targets in difficult clutter and jamming environments [9][10][11][12][13][14][15][16][17][18][19][20][21][22]. STAP performance is determined in part by how closely its interference covariance matrix, typically estimated from adjacent range cells located symmetrically around the test cell, matches the interference statistics of the test range bin.…”
Section: Introductionmentioning
confidence: 99%
“…(20), the SMI beamformer (8), the DL-SMI beamformer (10), the eigenspace-based beamformer [13], the Bayesian beamformer [23], the worst-case based robust beamformer [14], and the Bayesian beamformer with order recursive implementation [18]. In addition, the optimal SINR is also shown in all figures.…”
Section: Simulationsmentioning
confidence: 99%