ISR Distinguished Lecturer: P.P. Vaidyanathan, "Sparse Sensing with Coprime Sampling Lattices"

Tuesday, September 14, 2010
5:00 p.m.
1115 Computer Science Instructional Center
Regina King
301 405 6615
rking12@umd.edu

ISR Distinguished Lecturer Series
Sparse Sensing with Coprime Sampling Lattices

P.P. Vaidyanathan
Professor of Electrical Engineering
California Institute of Technology

Reception at 4:30 p.m.
Lecture at 5:00 p.m.

Roundtable discussion
Wednesday, Sept. 15, 10:30 a.m., 1146 A.V. Williams Bldg.

Host
Min Wu

Abstract
Imagine we have a pair of uniform samplers operating simultaneously on a signal. With the sampling rates arbitrarily small, is it possible to extract any useful information about the signal at all? It turns out that under some conditions of stationarity it is possible to recover second order statistical information, which is sufficient for many applications. For example, from samples of x(t) taken at the sparse rates fs=M and fs=N (where M and N are arbitrarily large but coprime), it is possible to estimate the autocorrelations at the dense sampling rate fs: The enabling principle in these applications comes from the theory of sparse coprime sampling. This talk focusses on this theory. Although the technique has surfaced in some applications in the distant past, a systematic development of the theory has evaded attention. We discuss both the one and multidimensional cases, and present applications both for temporal and spatial signals. In the multidimensional case, coprime sampling involves the construction of coprime lattices, a very interesting problem mathematically. One outcome of the theory is that under some conditions it is possible to combine two DFT filter banks with M and N bands and make them operate like an MN-band filter bank. Similarly it is possible to combine two sensor arrays with M and N sensors, such that there are O(MN) degrees of freedom, say, for beamforming and direction-of-arrival estimation (e.g., O(MN) sources can be identified with M +N sensors).

Similarly it is possible to compute a spectrum with resolution proportional to 1=MN by combining two systems which would individually produce only resolutions of 1=N and 1=M: A non standard application of this theory is in channel identification: somewhat surprisingly, a complex channel (not just second order information) can be identified by sending a pulse stream at an arbitrarily low rate and sampling the channel output at another arbitrarily low rate, coprimaly related to the transmission rate. This talk will give an overview of sparse coprime sampling theory, and elaborate on some of the above applications.

Biography
P.P. Vaidyanathan has been with the California Institute of Technology since 1983. His main research interests are in digital signal processing, multirate systems, wavelet transforms, digital communications, genomic signal processing, radar signal processing, and sparse array signal processing. He has authored more than 400 papers in journals and conferences, and is the author of the three books Multirate systems and filter banks (Prentice Hall, 1993), Linear Prediction Theory (Morgan and Claypool, 2008), and (with Phoong and Lin) Signal Processing and Optimization for Transceiver Systems (Cambridge University Press, 2010).

He was recipient of the award for excellence in teaching at the California Institute of Technology multiple times. His papers have received awards from IEEE and from the IETE (Institute of Electronics and Telecommunications Engineers, India). Dr. Vaidyanathan is a Fellow of the IEEE, recipient of the F. E. Terman Award of the American Society for Engineering Education, past distinguished lecturer for the IEEE Signal Processing Society, recipient of the IEEE CAS Society Golden Jubilee Medal, and recipient of the IEEE Signal Processing Society Technical Achievement Award.

Audience: Clark School  Graduate  Faculty  Post-Docs  Alumni  Corporate 

remind we with google calendar

 

March 2024

SU MO TU WE TH FR SA
25 26 27 28 29 1 2
3 4 5 6 7 8 9
10 11 12 13 14 15 16
17 18 19 20 21 22 23
24 25 26 27 28 29 30
31 1 2 3 4 5 6
Submit an Event