Universal Quantization for Separate Encodings and Joint Decoding of Correlated Sources
From MaRDI portal
Publication:2977153
DOI10.1109/TIT.2015.2489203zbMATH Open1359.94438arXiv1411.3597OpenAlexW2112337168MaRDI QIDQ2977153
Publication date: 28 April 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: We consider the multi-user lossy source-coding problem for continuous alphabet sources. In a previous work, Ziv proposed a single-user universal coding scheme which uses uniform quantization with dither, followed by a lossless source encoder (entropy coder). In this paper, we generalize Ziv's scheme to the multi-user setting. For this generalized universal scheme, upper bounds are derived on the redundancies, defined as the differences between the actual rates and the closest corresponding rates on the boundary of the rate region. It is shown that this scheme can achieve redundancies of no more than 0.754 bits per sample for each user. These bounds are obtained without knowledge of the multi-user rate region, which is an open problem in general. As a direct consequence of these results, inner and outer bounds on the rate-distortion achievable region are obtained.
Full work available at URL: https://arxiv.org/abs/1411.3597
Related Items (2)
Universal Source Coding for Monotonic and Fast Decaying Monotonic Distributions ⋮ Quantizers with uniform decoders and channel-optimized encoders
This page was built for publication: Universal Quantization for Separate Encodings and Joint Decoding of Correlated Sources
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2977153)
