An Achievable Rate-Distortion Region for Multiple Descriptions Source Coding Based on Coset Codes
نویسندگان
چکیده
We consider the problem of multiple descriptions (MD) source coding and propose new coding strategies involving both unstructured and structured coding layers. Previously, the most general achievable rate-distortion (RD) region for the l-descriptions problem was the Combinatorial Message Sharing with Binning (CMSB) region. The CMSB scheme utilizes unstructured quantizers and unstructured binning. In the first part of the paper, we show that this strategy can be improved upon using more general unstructured quantizers and a more general unstructured binning method. In the second part, structured coding strategies are considered. First, structured coding strategies are developed by considering specific MD examples involving three or more descriptions. We show that application of structured quantizers results in strict RD improvements when there are more than two descriptions. Furthermore, we show that structured binning also yields improvements. These improvements are in addition to the ones derived in the first part of the paper. This suggests that structured coding is essential when coding over more than two descriptions. Using the ideas developed through these examples we provide a new unified coding strategy by considering several structured coding layers. Finally, we characterize its performance in the form of an inner bound to the optimal rate-distortion region using computable single-letter information quantities. The new RD region strictly contains all of the previous known achievable regions.
منابع مشابه
Achievable rate region based on coset codes for multiple access channel with states
We derive a new achievable rate region for the problem of communicating over a multiple access channel with states. Our coding technique is based on the ensemble of nested coset codes and the technique of typicality decoding. Exploiting structure in this ensemble, we analyze a more efficient decoding strategy to improve upon the rate region achievable using unstructured codes. We identify examp...
متن کاملDistributed Source Coding using Abelian Group Codes
In this work, we consider a distributed source coding problem with a joint distortion criterion depending on the sources and the reconstruction. This includes as a special case the problem of computing a function of the sources to within some distortion and also the classic Slepian-Wolf problem [62], Berger-Tung problem [46], Wyner-Ziv problem [44], Yeung-Berger problem [47] and the Ahlswede-Ko...
متن کاملNew coding schemes for the symmetric K -description problem
We propose novel coding schemes for the Kdescription problem with symmetric rates and symmetric distortion constraints. There are two main new ingredients in these schemes: the first one is akin to the method seen in the well-known butterfly network of network coding literature, and systematic erasure channel codes are applied on certain carefully chosen source coding component; the second appr...
متن کاملOn the Achievable Rate-Regions for the Gaussian Two-way Diamond Channels
In this channel,we study rate region of a Gaussian two-way diamond channel which operates in half-duplex mode. In this channel, two transceiver (TR) nodes exchange their messages with the help of two relay nodes. We consider a special case of the Gaussian two-way diamond channels which is called Compute-and-Forward Multiple Access Channel (CF-MAC). In the CF-MAC, the TR nodes transmit their mes...
متن کاملRobust Distributed Source Coding with Arbitrary Number of Encoders and Practical Code Design Technique
The robustness property can be added to DSC system at the expense of reducing performance, i.e., increasing the sum-rate. The aim of designing robust DSC schemes is to trade off between system robustness and compression efficiency. In this paper, after deriving an inner bound on the rate–distortion region for the quadratic Gaussian MDC based RDSC system with two encoders, the structure of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1602.01911 شماره
صفحات -
تاریخ انتشار 2016