We will present the model of mobile communication, and will discuss the problem of channel estimation -- finding time-frequency shifts which a waveform undergoes while transmitted in the presence of a white noise. The digital model of the problem involves signals of length N (complex-valued vectors of length N). The current method of solving digital channel estimation problem uses O(N^2 log(N)) arithmetic operations. Using ideas from representation theory, we will present a new method of solving channel estimation problem of complexity O(N log(N)). The applications of the new method to mobile communication and GPS system will be discussed.<?xml:namespace prefix = o />

This is a joint work with S.Gurevich (Math, UW-Madison), R.Hadani (Math, UT-Austin), A.Sayeed (ECE, UW-Madison), O.Schwartz (EECS, UC Berkeley).

 Coffee and tea will be served in conjunction with WID Discovery at 3:30pm