Accurate detection of moving targets via random sensor arrays and Kerdock codes
Thomas Strohmer, Haichao Wang

TL;DR
This paper develops a rigorous mathematical framework for detecting moving targets with random sensor arrays in radar, utilizing Kerdock codes for transmission waveforms, and demonstrates practical effectiveness through simulations.
Contribution
It introduces the first mathematical theory for moving target detection with random arrays and employs Kerdock codes to enhance practical radar performance.
Findings
Theoretical recovery guarantees for moving targets using random arrays.
Kerdock codes possess properties beneficial for radar detection.
Numerical simulations confirm the theory's practical applicability.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
