High-Resolution Radar via Compressed Sensing

A stylized compressed sensing radar is proposed in which the time-frequency plane is discretized into an N times N grid. Assuming the number of targets K is small (i.e., K Lt N2), then we can transmit a sufficiently ldquoincoherentrdquo pulse and employ the techniques of compressed sensing to reconstruct the target scene. A theoretical upper bound on the sparsity K is presented. Numerical simulations verify that even better performance can be achieved in practice. This novel-compressed sensing approach offers great potential for better resolution over classical radar.

[1]  Deanna Needell,et al.  Uniform Uncertainty Principle and Signal Recovery via Regularized Orthogonal Matching Pursuit , 2007, Found. Comput. Math..

[2]  David Tse,et al.  Fundamentals of Wireless Communication , 2005 .

[3]  H. Rosu,et al.  A Survey of Finite Algebraic Geometrical Structures Underlying Mutually Unbiased Quantum Measurements , 2004, quant-ph/0409081.

[4]  K. Gröchenig.  Uncertainty Principles for Time-Frequency Representations , 2003 .

[5]  Thomas Strohmer,et al.  GRASSMANNIAN FRAMES WITH APPLICATIONS TO CODING AND COMMUNICATION , 2003, math/0301135.

[6]  Selin Aviyente,et al.  Underdetermined Source Separation in the Time-Frequency Domain , 2007, 2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07.

[7]  J. Seidel,et al.  BOUNDS FOR SYSTEMS OF LINES, AND JACOBI POLYNOMIALS , 1975 .

[8]  Desmond P. Taylor,et al.  Characterization of Randomly TimeVariant Linear Channels , 2007 .

[9]  D. M. Appleby.  Symmetric informationally complete–positive operator valued measures and the extended Clifford group , 2005 .

[10]  William O. Alltop,et al.  Complex sequences with low periodic correlations , 1980 .

[11]  D. Wehner.  High Resolution Radar , 1987 .

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

[13]  William O. Alltop,et al.  Complex sequences with low periodic correlations (Corresp.) , 1980, IEEE Trans. Inf. Theory.

[14]  J. Tropp.  On the conditioning of random subdictionaries , 2008 .

[15]  D. Donoho,et al.  Maximal Sparsity Representation via l 1 Minimization , 2002 .

[16]  Joel A. Tropp,et al.  Greed is good: algorithmic results for sparse approximation , 2004, IEEE Transactions on Information Theory.

[17]  Richard E. Blahut,et al.  Theory of Remote Surveillance Algorithms , 1991 .

[18]  Rémi Gribonval,et al.  Sparse representations in unions of bases , 2003, IEEE Trans. Inf. Theory.

[19]  Holger Rauhut,et al.  Edinburgh Research Explorer Identification of Matrices Having a Sparse Representation , 2022 .

[20]  P. Bello.  Characterization of Randomly Time-Variant Linear Channels , 1963 .

[21]  R. Rankin.  The Closest Packing of Spherical Caps in n Dimensions , 1955, Proceedings of the Glasgow Mathematical Association.

[22]  R. Tolimieri,et al.  Radar Ambiguity Functions and Group Theory , 1985 .

[23]  Michael Elad,et al.  A generalized uncertainty principle and sparse representation in pairs of bases , 2002, IEEE Trans. Inf. Theory.

[24]  R. Baraniuk,et al.  Compressive Radar Imaging , 2007, 2007 IEEE Radar Conference.

[25]  A. Robert Calderbank,et al.  The Finite Heisenberg-Weyl Groups in Radar and Communications , 2006, EURASIP J. Adv. Signal Process..

[26]  Michael Elad,et al.  On the stability of the basis pursuit in the presence of noise , 2006, Signal Process..

[27]  Lloyd R. Welch,et al.  Lower bounds on the maximum cross correlation of signals (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[28]  J.C. Preisig,et al.  Estimation and Equalization of Rapidly Varying Sparse Acoustic Communication Channels , 2006, OCEANS 2006.