2000
DOI: 10.1007/s11767-000-0001-4
|View full text |Cite
|
Sign up to set email alerts
|

A study of Reduced-Rank stap

Abstract: This paper starts with the discussion of the principle of Reduced-Rank (RR) Space-Time Adaptive Processing (STAP). It is followed by a dedication of the upper bound performance of all eigen-based RR methods provided by Cross Spectral Method (CSM) under the condition of a given processor rank and an identical secondary sample size. A performance comparison between two RR STAP processors with prefixed structure and CSM is performed by the means of simulations. It is shown that the performance of time pre-filteri… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
1
0

Year Published

2008
2008
2022
2022

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 7 publications
0
1
0
Order By: Relevance
“…Reducing the dimension or rank is often used to solve the problems mentioned above, by decreasing the system's DOF and selecting parts of the training sample data to estimate the CNCM of the cell to be detected [11][12][13][14]. For example, in STAP dimension reduction methods with fixed structure, the auxiliary channel processing (ACP) method [15] has been proposed by means of setting the two-dimensional beam near the clutter ridge as the auxiliary beam.…”
Section: Introductionmentioning
confidence: 99%
“…Reducing the dimension or rank is often used to solve the problems mentioned above, by decreasing the system's DOF and selecting parts of the training sample data to estimate the CNCM of the cell to be detected [11][12][13][14]. For example, in STAP dimension reduction methods with fixed structure, the auxiliary channel processing (ACP) method [15] has been proposed by means of setting the two-dimensional beam near the clutter ridge as the auxiliary beam.…”
Section: Introductionmentioning
confidence: 99%
“…Conversely, sub-optimal algorithms that require fewer samples have been devised. For instance, reduced-dimension [16,17] (e.g., loaded sample matrix inversion (LSMI) [6], 3DT [17]) and reduced-rank algorithms [18,19] (e.g., methods exploiting structural information) were proposed to diminish the demand for samples. These algorithms rely on specific assumptions about the data's statistical properties and suffer from performance loss [9].…”
Section: Introductionmentioning
confidence: 99%