TY - GEN
T1 - Compressed sensing based joint detection and tracking for STAP radar
AU - Liu, Jing
AU - Hu, Yu
AU - Lin, Yan
AU - Yang, Yi
AU - Duan, Zhansheng
N1 - Publisher Copyright:
© 2016 ISIF.
PY - 2016/8/1
Y1 - 2016/8/1
N2 - In this paper, we propose a novel compressed sensing based joint detection and tracking algorithm, named CS-JDT algorithm, to track multiple targets for STAP radar system. A novel general similar sensing matrix pursuit (GSSMP) algorithm is proposed to reconstruct the whole radar scenario (DOA-Doppler plane) for each range gate at consecutive scans. The proposed GSSMP algorithm addresses several problems in existing compressed sensing radar systems: First, it imposes no restrictions on the transmitter since the sensing matrix is built directly on the spatial-temporal steering matrix. There are no constraints on the correlation between any two columns of the sensing matrix since the proposed algorithm can deal with the sensing matrix with high coherence efficiently. Secondly, the size of the compact sensing matrix depends on the threshold of similarity distance used to divide the similar column groups, which does not increase with the resolution of the DOA-Doppler plane. Finally, the GSSMP algorithm can identify the correct subspace quite well, and reconstruct the original K-sparse signal representing the sparse radar scene perfectly, even in the condition of very closely spaced targets.
AB - In this paper, we propose a novel compressed sensing based joint detection and tracking algorithm, named CS-JDT algorithm, to track multiple targets for STAP radar system. A novel general similar sensing matrix pursuit (GSSMP) algorithm is proposed to reconstruct the whole radar scenario (DOA-Doppler plane) for each range gate at consecutive scans. The proposed GSSMP algorithm addresses several problems in existing compressed sensing radar systems: First, it imposes no restrictions on the transmitter since the sensing matrix is built directly on the spatial-temporal steering matrix. There are no constraints on the correlation between any two columns of the sensing matrix since the proposed algorithm can deal with the sensing matrix with high coherence efficiently. Secondly, the size of the compact sensing matrix depends on the threshold of similarity distance used to divide the similar column groups, which does not increase with the resolution of the DOA-Doppler plane. Finally, the GSSMP algorithm can identify the correct subspace quite well, and reconstruct the original K-sparse signal representing the sparse radar scene perfectly, even in the condition of very closely spaced targets.
UR - https://www.scopus.com/pages/publications/84992075193
M3 - 会议稿件
AN - SCOPUS:84992075193
T3 - FUSION 2016 - 19th International Conference on Information Fusion, Proceedings
SP - 1653
EP - 1660
BT - FUSION 2016 - 19th International Conference on Information Fusion, Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 19th International Conference on Information Fusion, FUSION 2016
Y2 - 5 July 2016 through 8 July 2016
ER -