January 8, Tuesday
13:00 – 14:00
Multi-Target Radar Detection with Almost Linear Complexity
Computer Science seminar
Lecturer : Alexander Fish
Affiliation : School of Mathematics and Statistics, University of Sydney
Location : 202/37
Host : Dr. Aryeh Kontorovich
We would like to know the distances to moving objects and their velocities. The radar system is built to fulfill this task. The radar transmits a waveform S which bounds back from the objects and the echo R is received. In practice we can work in the digital model, namely S and R are sequences of N complex numbers (e.g., N=1023). THE RADAR PROBLEM IS:
Design S, and an effective method of extracting, using S and R, the distances and velocities of all targets.
In many applications the current sequences S which are used are pseudo-random and the algorithm they support takes O(N²logN) arithmetic operations. In the lecture we will introduce the Heisenberg sequences, and a much faster detection algorithm called the Cross Method. It solves the Radar Problem in O(NlogN+m²) operations for m objects.
This is a joint work with S. Gurevich (Math, Madison), A. Sayeed (EE, Madison), K. Scheim (General Motors, Herzeliya), O. Schwartz (EECS, Berkeley).