pith. sign in

arxiv: 1203.2690 · v1 · pith:MTA4UNVTnew · submitted 2012-03-13 · 💻 cs.IT · math.IT· math.NA

Analysis of Sparse MIMO Radar

classification 💻 cs.IT math.ITmath.NA
keywords domainradarsparsetargetstheoreticalachievableadditivealgorithms
0
0 comments X
read the original abstract

We consider a multiple-input-multiple-output radar system and derive a theoretical framework for the recoverability of targets in the azimuth-range domain and the azimuth-range-Doppler domain via sparse approximation algorithms. Using tools developed in the area of compressive sensing, we prove bounds on the number of detectable targets and the achievable resolution in the presence of additive noise. Our theoretical findings are validated by numerical simulations.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.