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 2 ), 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.
Citation impact
1,044
total citations
- FWCI
- 84.10
- Percentile
- 100%
- References
- 34
Citations per year
Authors
2Topics & keywords
Topics
Keywords
- Compressed sensing
- Radar
- Computer science
- Algorithm
- Plane (geometry)
- Discretization
- Upper and lower bounds
- Resolution (logic)
No related works found for this paper.