BEGIN:VCALENDAR
METHOD:PUBLISH
PRODID:-//Apple Computer\, Inc//iCal 1.0//EN
X-WR-CALNAME;VALUE=TEXT:USC
VERSION:2.0
BEGIN:VEVENT
DESCRIPTION:Speaker: Yury Polyanskiy, Princeton University
Talk Title: Data Transmission: Non-Asymptotic Fundamental Limits
Abstract: Noise is an inalienable property of all communication systems appearing in nature. Such noise acts against the very purpose of communication, namely the delivery of data to its destination with minimal possible distortion. This creates a problem that has been addressed by various disciplines over the past century. In particular, information theory studies the question of the maximum possible rate achievable by an ideal system under certain assumptions regarding the noise generation and structural design constraints. The study of such questions, initiated by Claude Shannon in 1948, has typically been carried out in the asymptotic limit of an infinite number of signaling degrees of freedom (blocklength). \n
\n
At the same time, the increasing focus on latency and delay (such as in audio and video streaming), as well as the advent of modern sparse graph codes require characterizing the fundamental limits non-asymptotically, i.e. for blocklengths of the order of 1000. A systematic study of these practically motivated questions necessitates the development of new theoretical tools and techniques, which is the subject of this work. In particular, by obtaining precise non-asymptotic results, it is demonstrated that in many engineering problems a significant back-off from the (Shannon) capacity is incurred at finite blocklengths.\n
\n
Knowledge of the behavior of the fundamental limits in the non-asymptotic regime enables the analysis of many related questions, such as the assessment of the suboptimality of modern codes, energy efficiency, benefits of feedback, effects of dynamically varying channel state, fading, etc. As a result it is shown that in several instances classical (asymptotics-based) conclusions do not hold under this more refined approach.\n
\n
Biography: Yury Polyanskiy received the M.S. degree (with honors) in applied mathematics and physics from the Moscow Institute of Physics and Technology, Moscow, Russia in 2005 and the Ph.D. degree in electrical engineering from Princeton University, Princeton, NJ in 2010.\n
\n
In 2000-2005, he was with the Department of Surface Oilfield Equipment, Borets Company LLC, where he rose to the position of Chief Software Designer. His research interests include information theory, coding theory and the theory of random processes.\n
\n
Dr. Polyanskiy won a silver medal at the 30th International Physics Olympiad (IPhO), held in Padova, Italy. He was a recipient of the Best Student Paper Awards at the 2008 and 2010 IEEE International Symposia on Information Theory (ISIT). His final year of graduate studies was supported by a Princeton University Honorific Dodds Fellowship (2009-2010).
Host: Giuseppe Caire, caire@usc.edu, EEB 540, x04683
SEQUENCE:5
DTSTART:20110329T110000
LOCATION:EEB 248
DTSTAMP:20110329T110000
SUMMARY:Data Transmission: Non-Asymptotic Fundamental Limits
UID:EC9439B1-FF65-11D6-9973-003065F99D04
DTEND:20110329T120000
END:VEVENT
END:VCALENDAR