TY - JOUR
T1 - Fast STAP Method Based on PAST with Sparse Constraint for Airborne Phased Array Radar
AU - Yang, Xiaopeng
AU - Sun, Yuze
AU - Zeng, Tao
AU - Long, Teng
AU - Sarkar, Tapan K.
N1 - Publisher Copyright:
© 1991-2012 IEEE.
PY - 2016/9/1
Y1 - 2016/9/1
N2 - Conventional space-time adaptive processing (STAP) is difficult to effectively suppress nonhomogeneous clutter in practical airborne phased array radar systems owing to the requirements of large independent and identically distributed training samples and the high complexity involved in the inversion of a high dimensional matrix. In order to improve the clutter suppression performance with a small training sample supports, a fast STAP method based on projection approximation subspace tracking (PAST) with sparse constraint is proposed in this paper. In the proposed method, based on the low-rank property of the clutter covariance matrix, a sparse constraint is imposed in the cost function of PAST, and the adaptive weight vector is then derived iteratively. Because of the sparse constraint in PAST, the proposed method provides a more robust and stable estimation of the clutter subspace, especially when only a small set of training samples is available. Moreover, the proposed method not only achieves lower computational complexity compared with existing sparsity constrained STAP methods, but also better performance and faster convergence compared with conventional STAP methods without sparse constraint. The effectiveness of the proposed method is verified based on simulated and actual airborne phased array radar data.
AB - Conventional space-time adaptive processing (STAP) is difficult to effectively suppress nonhomogeneous clutter in practical airborne phased array radar systems owing to the requirements of large independent and identically distributed training samples and the high complexity involved in the inversion of a high dimensional matrix. In order to improve the clutter suppression performance with a small training sample supports, a fast STAP method based on projection approximation subspace tracking (PAST) with sparse constraint is proposed in this paper. In the proposed method, based on the low-rank property of the clutter covariance matrix, a sparse constraint is imposed in the cost function of PAST, and the adaptive weight vector is then derived iteratively. Because of the sparse constraint in PAST, the proposed method provides a more robust and stable estimation of the clutter subspace, especially when only a small set of training samples is available. Moreover, the proposed method not only achieves lower computational complexity compared with existing sparsity constrained STAP methods, but also better performance and faster convergence compared with conventional STAP methods without sparse constraint. The effectiveness of the proposed method is verified based on simulated and actual airborne phased array radar data.
KW - Space-time adaptive processing (STAP)
KW - computational complexity
KW - nonhomogeneous clutter
KW - projection approximation subspace tracking (PAST)
KW - sparse constraint
UR - http://www.scopus.com/inward/record.url?scp=84982798860&partnerID=8YFLogxK
U2 - 10.1109/TSP.2016.2569471
DO - 10.1109/TSP.2016.2569471
M3 - Article
AN - SCOPUS:84982798860
SN - 1053-587X
VL - 64
SP - 4550
EP - 4561
JO - IEEE Transactions on Signal Processing
JF - IEEE Transactions on Signal Processing
IS - 17
M1 - 7470515
ER -