A STUDY OF REDUCED-RANK STAP

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.

Sparse Reduced-Rank Regression with Outlier Detection

Based on the multivariate mean-shift regression model,we propose a new sparse reduced-rank regression approach to achieve low-rank sparse estimation and outlier detection simultaneously.A sparse mean-shift matrix is introduced in the model to indicate outliers.The rank constraint and the group-lasso type penalty for the coefficient matrix encourage the low-rank row sparse structure of coefficient matrix and help to achieve dimension reduction and variable selection.An algorithm is developed for solving our problem.In our simulation and real-data application,our new method shows competitive performance compared to other methods.

STUDY ON EFFICIENT COMPUTATION AND PERFORMANCE OF AV-BASED REDUCED-RANK FILTERING

In this paper, the complexity and performance of the Auxiliary Vector (AV) based reduced-rank filtering are addressed. The AV filters presented in the previous papers have the general form of the sum of the signature vector of the desired signal and a set of weighted AVs,which can be classified as three categories according to the orthogonality of their AVs and the optimality of the weight coefficients of the AVs. The AV filter with orthogonal AVs and optimal weight coefficients has the best performance, but requires considerable computational complexity and suffers from the numerical unstable operation. In order to reduce its computational load while keeping the superior performance, several low complexity algorithms are proposed to efficiently calculate the AVs and their weight coefficients. The diagonal loading technique is also introduced to solve the numerical unstability problem without complexity increase. The performance of the three types of AV filters is also compared through their application to Direct Sequence Code Division Multiple Access (DS-CDM A) systems for interference suppression.

Reduced-Rank Space-Time Processing for Anti-Jamming GPS Receivers

In a jamming environment with multiple wideband and narrowband jammers, global positioning system （GPS） receivers can use space-time processing to efficiently suppress the jamming. However, the computational complexity of space-time algorithms restricts their application in practical GPS receivers. This paper describes a reduced-rank multi-stage nested Wiener filter （MSNWF） based on subspace decomposition and Wiener filter （WF） to eliminate the effect of jamming in anti-jamming GPS receivers. A general sidelobe canceller （GSC） structure that is equivalent to the MSNWF is used to facilitate calculation of the optimal weights for the space-time processing. Simulation results demonstrate the satisfactory performance of the MSNWF to cancel jamming and the significant reduction in computational complexity by the reduced-rank processing. The technique offers a feasible space-time processing solution for anti-jamming GPS receivers.