Allerton 2015 Paper Abstract


Paper ThA6.1

Boda, Vinay Praneeth (University of Maryland, College Park), Narayan, Prakash (Institute for Systems Research)

Memoryless Sampling Rate Distortion

Scheduled for presentation during the Regular Session "Information Theory and Source Coding" (ThA6), Thursday, October 1, 2015, 08:30−08:50, Visitor Center

53rd Annual Allerton Conference on Communication, Control, and Computing, Sept 29-Oct 2, 2015, Allerton Park and Retreat Center, Monticello, IL, USA

This information is tentative and subject to change. Compiled on December 5, 2021

Keywords Information Theory


Consider a discrete memoryless multiple source with $m$ component sources. A subset of $k leq m$ sources are sampled at each time instant and jointly compressed in order to reconstruct all the $m$ sources under a given distortion criterion. A sampling rate distortion function is characterized for the case of memoryless random sampling with the sampler possibly depending on the source outputs; and the decoder is informed of the sequence of sampled sets. Examining the structure of the optimal sampler, it is shown that deterministic sampling, characterized by a conditional point-mass, suffices. Restricted forms of sampling are also addressed. An upper bound for the sampling rate distortion function is provided when the decoder is not informed of the sequence of sampled sets.



All Content © PaperCept, Inc..

This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2021 PaperCept, Inc.
Page generated 2021-12-05  10:02:52 PST  Terms of use