Performance Estimates of the Pseudo-Random Method for Radar Detection
Alexander Fish, Shamgar Gurevich

TL;DR
This paper analyzes the performance of the pseudo-random method in radar detection, showing that it becomes highly reliable with increasing sequence length under certain conditions.
Contribution
It provides theoretical performance estimates for the pseudo-random radar detection method, including probability of detection and false target expectations as sequence length grows.
Findings
Probability of detection approaches one as N increases.
Expected false targets approach zero with larger N.
Results hold under assumptions of uniformity and noise cancellation.
Abstract
A performance of the pseudo-random method for the radar detection is analyzed. The radar sends a pseudo-random sequence of length , and receives echo from targets. We assume the natural assumptions of uniformity on the channel and of the square root cancellation on the noise. Then for , where , the following holds: (i) the probability of detection goes to one, and (ii) the expected number of false targets goes to zero, as goes to infinity.
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.
