Abstract

In this paper, we present a novel distributed compressed sensing based joint detection and tracking algorithm for multistatic radar system, which significantly reduces the computational load in a centralized fusion framework. For different receivers in the multistatic radar system, their corresponding sparse vectors, which are represented in state space, share the same locations of nonzero reflection coefficients. This fits the joint sparsity model 2 (JSM-2) in distributed compressed sensing. In this paper, a novel algorithm, named distributed general similar sensing matrix pursuit (DGSSMP) algorithm, is proposed to tackle the generalized JSM-2 model when each individual sensing matrix is different and with high coherence. In contrast to the classical greedy algorithms dealing with single subspace, the proposed DGSSMP algorithm has to tackle a union of different subspaces, with each subspace corresponding to a different sensing matrix for each individual receiver. The simulation results show that in the proposed distributed compressed sensing based joint detection and tracking framework, the proposed DGSSMP algorithm together with the track before detect (TBD) scheme can effectively distinguish true targets from clutter based on the information from multiple scans.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.