摘要
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-filtering followed by jointly localized STAP structure (i.e. 3DT-SAP) is very close to the upper bound and thereby it is an effective RR approach.
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-filtering followed by jointly localized STAP structure (i.e. 3DT-SAP) is very close to the upper bound and thereby it is an effective RR approach.
