Design and Analysis of Compressed Sensing Radar Detectors

Abstract

We consider the problem of target detection from a set of Compressed Sensing (CS) radar measurements corrupted by additive white Gaussian noise. We propose two novel architectures and compare their performance by means of Receiver Operating Characteristic (ROC) curves. Using asymptotic arguments and the Complex Approximate Message Passing (CAMP) algorithm, we characterize the statistics of the ℓ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> -norm reconstruction error and derive closed form expressions for both the detection and false alarm probabilities of both schemes. Of the two architectures, we demonstrate that the best performing one consists of a reconstruction stage based on CAMP followed by a detector. This architecture, which outperforms the ℓ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> -based detector in the ideal case of known background noise, can also be made fully adaptive by combining it with a conventional Constant False Alarm Rate (CFAR) processor. Using the state evolution framework of CAMP, we also derive Signal to Noise Ratio (SNR) maps that, together with the ROC curves, can be used to design a CS-based CFAR radar detector. Our theoretical findings are confirmed by means of both Monte Carlo simulations and experimental results.