首页> 外文期刊>IEEE Transactions on Information Theory >The Sum Rate of Vector Gaussian Multiple Description Coding With Tree-Structured Covariance Distortion Constraints
【24h】

The Sum Rate of Vector Gaussian Multiple Description Coding With Tree-Structured Covariance Distortion Constraints

机译:具有树结构协方差失真约束的矢量高斯多描述编码的总和

获取原文
获取原文并翻译 | 示例
           

摘要

A single-letter lower bound on the sum rate of multiple description coding with tree-structured distortion constraints is established by generalizing Ozarow’s celebrated converse argument through the introduction of auxiliary random variables that form a Markov tree. For the quadratic vector Gaussian case, this lower bound is shown to be achievable by an extended El Gamal-Cover scheme, yielding a complete characterization of the minimum sum rate.
机译:通过引入形成马尔可夫树的辅助随机变量来概括Ozarow著名的相反论点,从而建立了具有树结构失真约束的多描述编码总和的单字母下限。对于二次向量高斯情况,该下限显示为可通过扩展的El Gamal-Cover方案实现,从而给出了最小和速率的完整表征。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号