In this paper, we develop a new algorithm for centralized target detection in passive MIMO radar (PMR) using sparse recovery technique. PMRs use a network of receivers and illuminators of… Click to show full abstract
In this paper, we develop a new algorithm for centralized target detection in passive MIMO radar (PMR) using sparse recovery technique. PMRs use a network of receivers and illuminators of opportunity to detect and localize targets. We consider a widely separated PMR network assuming the availability of reference channels. We first transform the collected information of all receivers to a common space and combine them to attain a unified model. The problem of target detection in the extracted model is equal to a block sparse recovery problem. Since employing the generic sparse recovery tools are impractical due to the ultra-large dimension of the sensing matrix, we exploit the structure of the involving matrices and propose a very efficient distributed algorithm which extracts all scatterers, including targets and clutter simultaneously with a unified procedure. The proposed algorithm is highly efficient, and it does not require a high bandwidth link to transfer raw data from nodes to the fusion center. Moreover, the algorithm inherently benefits from parallel processing and distributes the extensive computations among receivers. Our simulation results demonstrate that the proposed algorithm outperforms the popular PMR detection algorithm, especially in the presence of interfering targets and any strong clutter residue.
               
Click one of the above tabs to view related content.