arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0911.2346cs.ITmath.IT
收藏

非对称多级分集编码与非对称高斯多重描述

Asymmetric Multilevel Diversity Coding and Asymmetric Gaussian Multiple Descriptions

Soheil Mohajer, Chao Tian, Suhas N. Diggavi

摘要:

我们考虑非对称多级分集(A-MLD)编码问题,其中一组$2^K-1$信息源,按重要性递减的顺序,被编码成$K$消息(或描述)。存在$2^K-1$解码器,每个解码器都可以访问编码消息的非空子集。每个解码器需要再现的信息源到一定的重要性水平取决于组合的描述提供给it. We获得一个单一的字母表征的可实现的速率区域的3-描述问题。与对称多级分集编码相比,信源分离编码在非对称情况下是不够的,需要策略性地使用类似于网络编码的思想。基于在处理A-MLD问题中获得的直觉,我们得到了三种描述的非对称高斯多描述(MD)问题的速率区域的内界和外界。内、外边界与A-MLD编码问题的速率区域模板具有相似的几何结构,并且证明了它们之间的距离很小,从而得到了非对称高斯三描述速率区域的近似特征.

英文摘要:

We consider the asymmetric multilevel diversity (A-MLD) coding problem, where a set of $2^K-1$ information sources, ordered in a decreasing level of importance, is encoded into $K$ messages (or descriptions). There are $2^K-1$ decoders, each of which has access to a non-empty subset of the encoded messages. Each decoder is required to reproduce the information sources up to a certain importance level depending on the combination of descriptions available to it. We obtain a single letter characterization of the achievable rate region for the 3-description problem. In contrast to symmetric multilevel diversity coding, source-separation coding is not sufficient in the asymmetric case, and ideas akin to network coding need to be used strategically. Based on the intuitions gained in treating the A-MLD problem, we derive inner and outer bounds for the rate region of the asymmetric Gaussian multiple description (MD) problem with three descriptions. Both the inner and outer bounds have a similar geometric structure to the rate region template of the A-MLD coding problem, and moreover, we show that the gap between them is small, which results in an approximate characterization of the asymmetric Gaussian three description rate region.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑