SUNMONTUEWEDTHUFRISAT
Events for March 13, 2014
-
Lossy Data Compression: Non-asymptotic Fundamental Limits
Thu, Mar 13, 2014 @ 09:30 AM - 10:30 AM
Ming Hsieh Department of Electrical and Computer Engineering
Conferences, Lectures, & Seminars
Speaker: Victoria Kostina, Princeton University
Talk Title: Lossy Data Compression: Non-asymptotic Fundamental Limits
Abstract: The basic tradeoff in lossy compression is that between the compression ratio (rate) and the fidelity of reproduction of the object that is compressed. Traditional (asymptotic) information theory seeks to describe the optimum tradeoff between rate and fidelity achievable in the limit of infinite length of the source block to be compressed. A perennial question in information theory is how relevant the asymptotic fundamental limits are when the communication system is forced to operate at a given, fixed blocklength. The finite blocklength (delay) constraint is inherent to all communication scenarios. In fact, in many systems of current interest, such as real-time multimedia communication, delays are strictly constrained, while in packetized data communication, packets are frequently on the order of 1000 bits.
Motivated by critical practical interest in non-asymptotic information-theoretic limits, we study the optimum rate-fidelity tradeoffs in lossy source coding and joint source-channel coding at a given fixed blocklength. While computable formulas for the asymptotic fundamental limits are available for a wide class of channels and sources, the luxury of being able to compute exactly (in polynomial time) non-asymptotic fundamental limits is rarely affordable. One can at most hope to obtain bounds and approximations to information-theoretic non-asymptotic fundamental limits. Our main findings include tight bounds to the non-asymptotic fundamental limits in lossy data compression and transmission, valid for general sources without any assumptions on ergodicity or memorylessness. Moreover, in the stationary memoryless case we show a simple formula approximating the non-asymptotic optimal coding rate that involves only two parameters of the source.
Biography: Victoria Kostina received the Bachelors degree with honors in applied mathematics and physics from the Moscow Institute of Physics and Technology, Russia, in 2004, where she was affiliated with the Institute for Information Transmission Problems of the Russian Academy of Sciences, and the Masters degree in electrical engineering from the University of Ottawa, Canada, in 2006. In September 2013, she completed her Ph.D. in electrical engineering at Princeton University, and is currently a postdoctoral researcher working with Prof. Sergio Verdú. Her research interests lie in information theory, theory of random processes, coding, and wireless communications. She is the recipient of two Natural Sciences and Engineering Research Council of Canada postgraduate fellowships, the Upton Fellowship in Engineering from Princeton University, the University of Ottawa Excellence Scholarship, the University of Ottawa Admission Scholarship and the Moscow Institute of Physics and Technology Excellence Scholarship.
Host: Urbashi Mitra, ubli@usc.edu, EEB 540, x04667
Location: Hughes Aircraft Electrical Engineering Center (EEB) - 248
Audiences: Everyone Is Invited
Contact: Susan Wiedem
-
EE Distinguished Lecturer Series
Thu, Mar 13, 2014 @ 03:00 PM - 04:00 PM
Ming Hsieh Department of Electrical and Computer Engineering
Conferences, Lectures, & Seminars
Speaker: Bruce Hajek, Prof. Leonard C. and Mary Lou Hoeft Endowed Chair in Engineering, University of Illinois at Urbana-Champaign
Abstract: This talk will focus on theory and practice of combinatorial auctions and their application to the sale of wireless spectrum licenses. As new wireless applications emerge worldwide, the wireless industry and government regulators are looking to reallocate wireless spectrum to better match the demand. Combinatorial auctions can play an effective role in the allocation process, but important implementation and theoretical issues remain. The talk will include an overview of recent research on the use of profit sharing contracts and core projecting auctions. (Joint work with Vineet Abhishek and Prof. Steven Williams)
Biography: Bruce Hajek received the BS in Mathematics and MS in Electrical Engineering from the University of Illinois and the Ph. D. in Electrical Engineering from the
University of California at Berkeley. Since 1979 he has been on the faculty of the Department of Electrical and Computer Engineering and the Coordinated
Science Laboratory, at the University of Illinois at Urbana-Champaign. Dr. Hajek pursues basic research in the area of modeling, analysis, and optimization in communication systems and networks. His recent research has focused on allocation based on game theory, peer-to-peer network protocols, and inference in graphical models. He received the IEEE Kobayashi Award for Computer Communications and the Donald P. Eckman Award of the IEEE Control Systems Society. He was elected to the US National Academy of Engineering in 1999.
Host: Rahul Jain & Michael Neely
More Info: http://ee.usc.edu/news/dls/
More Information: 20140313 Hajek Print (2).pdf
Location: Hughes Aircraft Electrical Engineering Center (EEB) - 132
Audiences: Everyone Is Invited
Contact: Estela Lopez
Event Link: http://ee.usc.edu/news/dls/
