1994
DOI: 10.1109/7.250406
|View full text |Cite
|
Sign up to set email alerts
|

Adaptive detection using low rank approximation to a data matrix

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
31
0
2

Year Published

2011
2011
2023
2023

Publication Types

Select...
3
3
2

Relationship

1
7

Authors

Journals

citations
Cited by 214 publications
(33 citation statements)
references
References 22 publications
0
31
0
2
Order By: Relevance
“…A vast portion of the research effort has been devoted to the airborne STAP. Most of them are concerned about how to reduce the number of the secondary data, how to enhance the capability of detecting the slowly moving target, the computational complexity and the sample limitation for estimating the clutter covariance matrix, and so on; such as reduced-dimension (RD-STAP) [2], [3], reduced-rank (RR) [4], time varying spacetime auto regressive filtering (TV-STAR) [5], and the extend factor approach (EFA) [6].…”
Section: Introductionmentioning
confidence: 99%
“…A vast portion of the research effort has been devoted to the airborne STAP. Most of them are concerned about how to reduce the number of the secondary data, how to enhance the capability of detecting the slowly moving target, the computational complexity and the sample limitation for estimating the clutter covariance matrix, and so on; such as reduced-dimension (RD-STAP) [2], [3], reduced-rank (RR) [4], time varying spacetime auto regressive filtering (TV-STAR) [5], and the extend factor approach (EFA) [6].…”
Section: Introductionmentioning
confidence: 99%
“…It is based on the structure of the optimum interference canceller and requires a minimum number of assumptions about the interference characteristics. Intuitive arguments of how low-rank structure is natural in many sensor applications have been discussed in [7]. Performance analysis has shown that its performance is close to that of the clairvoyant processor that utilizes complete knowledge of the linear algebraic structure in the data [6,7].…”
Section: Difficulties In Auulving Freauencv Domain Methodsmentioning
confidence: 99%
“…A measure of the power arriving from a direction θ is given by the function to be minimized in (1). If the exact MVDR beamformer w from equation (2) is used, then the expression for S xx in (1) can be simplified to S xx = 1/s H w. We show that this simplification is also valid when w is substituted by a low rank solution, w (r) using the CG algorithm.…”
Section: Computation Of the Power Spectrummentioning
confidence: 97%
“…where the Lagrange multiplier serves to satisfy the unity gain constraint in (1). In Steering-Independent CG, the CG algorithm is used to solve Rw = s; the solution obtained at step r of CG is denoted w (r) .…”
Section: Steering-independent Beamformingmentioning
confidence: 99%
See 1 more Smart Citation