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. For the mean-square error distortion measure, it is shown that this scheme can achieve redundancies of no more than 0.754 b per sample for each user. These bounds are obtained without the knowledge of the multi-user rate region, which is an open problem in general. As a direct consequence of these results, the inner and outer bounds on the rate-distortion achievable region are obtained.
| Original language | English |
|---|---|
| Article number | 7295609 |
| Pages (from-to) | 6465-6474 |
| Number of pages | 10 |
| Journal | IEEE Transactions on Information Theory |
| Volume | 61 |
| Issue number | 12 |
| DOIs | |
| State | Published - Dec 2015 |
Keywords
- Dithered quantization
- Multi-terminal source coding
- Scalar quantization
- Slepian-Wolf coding
- Universal source coding
All Science Journal Classification (ASJC) codes
- Information Systems
- Computer Science Applications
- Library and Information Sciences
Fingerprint
Dive into the research topics of 'Universal Quantization for Separate Encodings and Joint Decoding of Correlated Sources'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver