3 research outputs found
Accurate detection of moving targets via random sensor arrays and Kerdock codes
The detection and parameter estimation of moving targets is one of the most
important tasks in radar. Arrays of randomly distributed antennas have been
popular for this purpose for about half a century. Yet, surprisingly little
rigorous mathematical theory exists for random arrays that addresses
fundamental question such as how many targets can be recovered, at what
resolution, at which noise level, and with which algorithm. In a different line
of research in radar, mathematicians and engineers have invested significant
effort into the design of radar transmission waveforms which satisfy various
desirable properties. In this paper we bring these two seemingly unrelated
areas together. Using tools from compressive sensing we derive a theoretical
framework for the recovery of targets in the azimuth-range-Doppler domain via
random antennas arrays. In one manifestation of our theory we use Kerdock codes
as transmission waveforms and exploit some of their peculiar properties in our
analysis. Our paper provides two main contributions: (i) We derive the first
rigorous mathematical theory for the detection of moving targets using random
sensor arrays. (ii) The transmitted waveforms satisfy a variety of properties
that are very desirable and important from a practical viewpoint. Thus our
approach does not just lead to useful theoretical insights, but is also of
practical importance. Various extensions of our results are derived and
numerical simulations confirming our theory are presented
Structured random measurements in signal processing
Compressed sensing and its extensions have recently triggered interest in
randomized signal acquisition. A key finding is that random measurements
provide sparse signal reconstruction guarantees for efficient and stable
algorithms with a minimal number of samples. While this was first shown for
(unstructured) Gaussian random measurement matrices, applications require
certain structure of the measurements leading to structured random measurement
matrices. Near optimal recovery guarantees for such structured measurements
have been developed over the past years in a variety of contexts. This article
surveys the theory in three scenarios: compressed sensing (sparse recovery),
low rank matrix recovery, and phaseless estimation. The random measurement
matrices to be considered include random partial Fourier matrices, partial
random circulant matrices (subsampled convolutions), matrix completion, and
phase estimation from magnitudes of Fourier type measurements. The article
concludes with a brief discussion of the mathematical techniques for the
analysis of such structured random measurements.Comment: 22 pages, 2 figure