Quadrature Compressive Sampling for Radar Signals

Quadrature sampling has been widely applied in coherent radar systems to extract in-phase and quadrature ( I and Q) components in the received radar signal. However, the sampling is inefficient because the received signal contains only a small number of significant target signals. This paper incorporates the compressive sampling (CS) theory into the design of the quadrature sampling system, and develops a quadrature compressive sampling (QuadCS) system to acquire the I and Q components with low sampling rate. The QuadCS system first randomly projects the received signal into a compressive bandpass signal and then utilizes the quadrature sampling to output compressive I and Q components. The compressive outputs are used to reconstruct the I and Q components. To understand the system performance, we establish the frequency domain representation of the QuadCS system. With the waveform-matched dictionary, we prove that the QuadCS system satisfies the restricted isometry property with overwhelming probability. For K target signals in the observation interval T, simulations show that the QuadCS requires just O(Klog(BT/K)) samples to stably reconstruct the signal, where B is the signal bandwidth. The reconstructed signal-to-noise ratio decreases by 3 dB for every octave increase in the target number K and increases by 3 dB for every octave increase in the compressive bandwidth. Theoretical analyses and simulations verify that the proposed QuadCS is a valid system to acquire the I and Q components in the received radar signals.

[1]  M. Salman Asif,et al.  Compressive Sensing for streaming signals using the Streaming Greedy Pursuit , 2010, 2010 - MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE.

[2]  Massimo Fornasier,et al.  Numerical Methods for Sparse Recovery , 2010 .

[3]  Guangming Shi,et al.  UWB Echo Signal Detection With Ultra-Low Rate Sampling Based on Compressed Sensing , 2008, IEEE Transactions on Circuits and Systems II: Express Briefs.

[4]  Michael P. Friedlander,et al.  Probing the Pareto Frontier for Basis Pursuit Solutions , 2008, SIAM J. Sci. Comput..

[5]  Wotao Yin,et al.  Bregman Iterative Algorithms for (cid:2) 1 -Minimization with Applications to Compressed Sensing ∗ , 2008 .

[6]  Dmitry M. Malioutov,et al.  A sparse signal reconstruction perspective for source localization with sensor arrays , 2005, IEEE Transactions on Signal Processing.

[7]  Rodney G. Vaughan,et al.  The theory of bandpass sampling , 1991, IEEE Trans. Signal Process..

[8]  S. Frick,et al.  Compressed Sensing , 2014, Computer Vision, A Reference Guide.

[9]  Sergiy A. Vorobyov,et al.  Segmented Compressed Sampling for Analog-to-Information Conversion: Method and Performance Analysis , 2010, IEEE Transactions on Signal Processing.

[10]  R. DeVore,et al.  A Simple Proof of the Restricted Isometry Property for Random Matrices , 2008 .

[11]  N. Levanon,et al.  Basic Radar Signals , 2004 .

[12]  E. Candès The restricted isometry property and its implications for compressed sensing , 2008 .

[13]  Richard G. Baraniuk,et al.  The Pros and Cons of Compressive Sensing for Wideband Signal Acquisition: Noise Folding vs. Dynamic Range , 2011, ArXiv.

[14]  Eero P. Simoncelli,et al.  Recovery of Sparse Translation-Invariant Signals With Continuous Basis Pursuit , 2011, IEEE Transactions on Signal Processing.

[15]  R. Inkol,et al.  A digital quadrature demodulation system , 1996 .

[16]  David C. Chu,et al.  Polyphase codes with good periodic correlation properties (Corresp.) , 1972, IEEE Trans. Inf. Theory.

[17]  Tyrone L. Vincent,et al.  Concentration of Measure Inequalities for Toeplitz Matrices With Applications , 2011, IEEE Transactions on Signal Processing.

[18]  Richard G. Baraniuk,et al.  Signal Processing With Compressive Measurements , 2010, IEEE Journal of Selected Topics in Signal Processing.

[19]  Richard G. Baraniuk,et al.  Theory and Implementation of an Analog-to-Information Converter using Random Demodulation , 2007, 2007 IEEE International Symposium on Circuits and Systems.

[20]  S. Kirolos,et al.  Random Sampling for Analog-to-Information Conversion of Wideband Signals , 2006, 2006 IEEE Dallas/CAS Workshop on Design, Applications, Integration and Software.

[21]  M. Ledoux The concentration of measure phenomenon , 2001 .

[22]  Michael Elad,et al.  Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ1 minimization , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[23]  Emmanuel J. Candès,et al.  Templates for convex cone problems with applications to sparse signal recovery , 2010, Math. Program. Comput..

[24]  Richard G. Baraniuk,et al.  Random Filters for Compressive Sampling and Reconstruction , 2006, 2006 IEEE International Conference on Acoustics Speech and Signal Processing Proceedings.

[25]  Robert L. Frank,et al.  Polyphase codes with good nonperiodic correlation properties , 1963, IEEE Trans. Inf. Theory.

[26]  Michael P. Friedlander,et al.  Sparse Optimization with Least-Squares Constraints , 2011, SIAM J. Optim..

[27]  Joel A. Tropp,et al.  Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit , 2007, IEEE Transactions on Information Theory.

[28]  A. Robert Calderbank,et al.  Sensitivity to Basis Mismatch in Compressed Sensing , 2011, IEEE Trans. Signal Process..

[29]  Dimitris Achlioptas,et al.  Database-friendly random projections , 2001, PODS.

[30]  Richard G. Baraniuk,et al.  The Pros and Cons of Compressive Sensing for Wideband Signal Acquisition: Noise Folding versus Dynamic Range , 2011, IEEE Transactions on Signal Processing.

[31]  Yonina C. Eldar,et al.  Xampling: Signal Acquisition and Processing in Union of Subspaces , 2009, IEEE Transactions on Signal Processing.

[32]  M. Talagrand A new look at independence , 1996 .

[33]  Yonina C. Eldar,et al.  Noise Folding in Compressed Sensing , 2011, IEEE Signal Processing Letters.

[34]  Mark A. Davenport,et al.  Random Observations on Random Observations: Sparse Signal Acquisition and Processing , 2010 .

[35]  Yonina C. Eldar,et al.  Sub-Nyquist Radar via Doppler Focusing , 2012, IEEE Transactions on Signal Processing.

[36]  Justin K. Romberg,et al.  Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals , 2009, IEEE Transactions on Information Theory.

[37]  Sanjoy Dasgupta,et al.  An elementary proof of a theorem of Johnson and Lindenstrauss , 2003, Random Struct. Algorithms.

[38]  Justin K. Romberg,et al.  Sparse Recovery of Streaming Signals Using $\ell_1$-Homotopy , 2013, IEEE Transactions on Signal Processing.

[39]  Michael B. Wakin,et al.  Concentration of Measure for Block Diagonal Matrices With Applications to Compressive Signal Processing , 2011, IEEE Transactions on Signal Processing.

[40]  Deanna Needell,et al.  CoSaMP: Iterative signal recovery from incomplete and inaccurate samples , 2008, ArXiv.

[41]  Emmanuel J. Candès,et al.  Decoding by linear programming , 2005, IEEE Transactions on Information Theory.

[42]  J. Tropp,et al.  SIGNAL RECOVERY FROM PARTIAL INFORMATION VIA ORTHOGONAL MATCHING PURSUIT , 2005 .

[43]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

[44]  N. Levanon,et al.  RADAR SIGNALS , 2013 .