Parallel frequency radar via compressive sensing

Traditional radar utilizes Shannon-Nyquist theorem for high bandwidth signal sampling, which induces the complicated system. Compressive sensing (CS) indicates that the compressible signal using a few measurements can be reconstructed by solving a convex optimization problem. Thus, the huge amount of data according to high Shannon-Nyquist rate is significantly reduced by compressive sensing. Parallel frequency radar theoretically cannot degrade the resolution compared with a traditional radar system and effectively reduces the sampling rate. In this paper, we focus on the data processing of the novel radar system. Basing on a sufficient structure, an algorithm of target scene reconstruction in pursuance of compressive sensing applied to the novel radar is proposed. Several simulations demonstrate the feasibility and the superiority of parallel frequency radar via compressive sensing.

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

[2]  David L Donoho,et al.  Compressed sensing , 2006, IEEE Transactions on Information Theory.

[3]  Mike E. Davies,et al.  Gradient Pursuits , 2008, IEEE Transactions on Signal Processing.

[4]  Joachim H. G. Ender,et al.  On compressive sensing applied to radar , 2010, Signal Process..

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

[6]  Michael Elad,et al.  Stable recovery of sparse overcomplete representations in the presence of noise , 2006, IEEE Transactions on Information Theory.

[7]  S. Mallat,et al.  Adaptive greedy approximations , 1997 .

[8]  E.J. Candes Compressive Sampling , 2022 .