2016
DOI: 10.1109/lgrs.2016.2519765
|View full text |Cite
|
Sign up to set email alerts
|

Subspace-Augmented Clutter Suppression Technique for STAP Radar

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
29
0

Year Published

2016
2016
2020
2020

Publication Types

Select...
10

Relationship

0
10

Authors

Journals

citations
Cited by 46 publications
(29 citation statements)
references
References 14 publications
0
29
0
Order By: Relevance
“…Magraner et al [20] presented a new technique based on cellaveraging CFAR detection, and it achieved good detection results. Wang et al [21] proposed a novel subspace STAP algorithm by combining the conventional method and augmented subspace, and the numerical results demonstrated that the proposed algorithm has a superior performance in a finite-training-sample situation. Although much work has been done, the detection of slow or weak targets is still difficult.…”
Section: Introductionmentioning
confidence: 99%
“…Magraner et al [20] presented a new technique based on cellaveraging CFAR detection, and it achieved good detection results. Wang et al [21] proposed a novel subspace STAP algorithm by combining the conventional method and augmented subspace, and the numerical results demonstrated that the proposed algorithm has a superior performance in a finite-training-sample situation. Although much work has been done, the detection of slow or weak targets is still difficult.…”
Section: Introductionmentioning
confidence: 99%
“…Subspace-based methods have also been studied in the literature by using the principal subspace of CNCM instead. For example, the eigen-canceller method based on the direct eigenvalue decomposition (EVD) of CNCM was developed in [7]. This method, however, is not attractive for real-time processing due to its high computational complexity.…”
Section: Introductionmentioning
confidence: 99%
“…In nulled SR-STAP, the clutter subspace is first obtained by using SR algorithms, and then the STAP weight vector is calculated by projecting the data of CUT into the subspace orthogonal to the clutter subspace [35]. In [36], a subspace-augmented STAP algorithm is presented, which utilizes the direct portion and supplemented portion to construct the entire clutter subspace. In [37], a fast STAP based on the projection approximation subspace tracking (PAST) with sparse constraint and the low-rank property of CCM is developed, which uses a small training data support and can achieve a robust estimation of the clutter subspace.…”
Section: Introductionmentioning
confidence: 99%