Compressed sensing radar

Author

Herman, Matthew ; Strohmer, Thomas

Author_Institution

Dept. of Math., Univ. of California, Davis, Davis, CA

fYear

2008

fDate

March 31 2008-April 4 2008

Firstpage

1509

Lastpage

1512

Abstract

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 N²), then we can transmit a sufficiently "incoherent" 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.

Keywords

identification; numerical analysis; radar signal processing; time-frequency analysis; Gabor analysis; compressed sensing radar; numerical simulations; sparse recovery; system identification; target scene; time-frequency plane; Compressed sensing; Image reconstruction; Layout; Matching pursuit algorithms; Mathematics; Pulse compression methods; Radar imaging; Time frequency analysis; Uncertainty; Upper bound; Compressed sensing; Gabor analysis; radar; sparse recovery; system identification;

fLanguage

English

Publisher

ieee

Conference_Titel

Acoustics, Speech and Signal Processing, 2008. ICASSP 2008. IEEE International Conference on

Conference_Location

Las Vegas, NV

ISSN

1520-6149

Print_ISBN

978-1-4244-1483-3

Electronic_ISBN

1520-6149

Type

conf

DOI

10.1109/ICASSP.2008.4517908

Filename

4517908