对称畸变约束下的高斯k -描述问题

C. Tian, S. Mohajer, S. Diggavi
{"title":"对称畸变约束下的高斯k -描述问题","authors":"C. Tian, S. Mohajer, S. Diggavi","doi":"10.1109/ITA.2008.4601081","DOIUrl":null,"url":null,"abstract":"We consider multiple description (MD) coding for the Gaussian source under the symmetric mean squared error distortion constraints. With focus on the three description problem, we provide inner and outer bounds for the rate region, between which the gap can be bounded by some small constants. At the heart of this result is a novel lower bound for the sum rate, which is derived through generalization of the well-known bounding technique by Ozarow. In contrast to the original method, we expand the probability space by more than one (instead of only one) random variable, and further impose a particular Markov structure on them. The outer bound is then established by applying this technique to several bounding planes of the rate region. For the inner bound, we consider a simple scheme of combining successive refinement coding and lossless multilevel diversity coding (MLD). Both the inner and outer bounds can be written as the intersection of ten half spaces with matching normal directions, and thus can be easily compared. The small gap between them, where the boundary of the MD rate region clearly resides, suggests the surprising competitiveness of this simple achievability scheme. The geometric structure of the MLD rate region provides important guidelines as to the normal directions of the outer bound hyperplanes, which demonstrates an intimate connection between MD and MLD coding. These results can be generalized and improved in various ways which are also discussed.","PeriodicalId":345196,"journal":{"name":"2008 Information Theory and Applications Workshop","volume":"85 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the Gaussian K-description problem under symmetric distortion constraints\",\"authors\":\"C. Tian, S. Mohajer, S. Diggavi\",\"doi\":\"10.1109/ITA.2008.4601081\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider multiple description (MD) coding for the Gaussian source under the symmetric mean squared error distortion constraints. With focus on the three description problem, we provide inner and outer bounds for the rate region, between which the gap can be bounded by some small constants. At the heart of this result is a novel lower bound for the sum rate, which is derived through generalization of the well-known bounding technique by Ozarow. In contrast to the original method, we expand the probability space by more than one (instead of only one) random variable, and further impose a particular Markov structure on them. The outer bound is then established by applying this technique to several bounding planes of the rate region. For the inner bound, we consider a simple scheme of combining successive refinement coding and lossless multilevel diversity coding (MLD). Both the inner and outer bounds can be written as the intersection of ten half spaces with matching normal directions, and thus can be easily compared. The small gap between them, where the boundary of the MD rate region clearly resides, suggests the surprising competitiveness of this simple achievability scheme. The geometric structure of the MLD rate region provides important guidelines as to the normal directions of the outer bound hyperplanes, which demonstrates an intimate connection between MD and MLD coding. These results can be generalized and improved in various ways which are also discussed.\",\"PeriodicalId\":345196,\"journal\":{\"name\":\"2008 Information Theory and Applications Workshop\",\"volume\":\"85 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-08-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 Information Theory and Applications Workshop\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITA.2008.4601081\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Information Theory and Applications Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITA.2008.4601081","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

研究了对称均方误差失真约束下高斯源的多重描述编码。针对三个描述问题,我们给出了速率区域的内外边界,两者之间的间隙可以用一些小常数来限定。这个结果的核心是一个新的和速率的下界,它是通过推广著名的Ozarow的边界技术推导出来的。与原始方法相比,我们将概率空间扩展为多个(而不是只有一个)随机变量,并进一步在它们上施加特定的马尔可夫结构。然后将该技术应用于速率区域的几个边界面,建立了外边界。对于内界,我们考虑了一种简单的结合连续细化编码和无损多电平分集编码的方案。内界和外界都可以写成十个具有匹配法线方向的半空间的交点,因此可以很容易地进行比较。它们之间的小差距(MD率区域的边界明显存在)表明,这种简单的可实现方案具有惊人的竞争力。MLD速率区域的几何结构为外界超平面的法线方向提供了重要的指导,证明了MD和MLD编码之间的密切联系。这些结果可以用各种方法加以推广和改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
On the Gaussian K-description problem under symmetric distortion constraints
We consider multiple description (MD) coding for the Gaussian source under the symmetric mean squared error distortion constraints. With focus on the three description problem, we provide inner and outer bounds for the rate region, between which the gap can be bounded by some small constants. At the heart of this result is a novel lower bound for the sum rate, which is derived through generalization of the well-known bounding technique by Ozarow. In contrast to the original method, we expand the probability space by more than one (instead of only one) random variable, and further impose a particular Markov structure on them. The outer bound is then established by applying this technique to several bounding planes of the rate region. For the inner bound, we consider a simple scheme of combining successive refinement coding and lossless multilevel diversity coding (MLD). Both the inner and outer bounds can be written as the intersection of ten half spaces with matching normal directions, and thus can be easily compared. The small gap between them, where the boundary of the MD rate region clearly resides, suggests the surprising competitiveness of this simple achievability scheme. The geometric structure of the MLD rate region provides important guidelines as to the normal directions of the outer bound hyperplanes, which demonstrates an intimate connection between MD and MLD coding. These results can be generalized and improved in various ways which are also discussed.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Cellular systems with multicell processing and conferencing links between mobile stations On resource allocation in two-way limited feedback beamforming systems Can the storage capacity of memories built from unreliable components be determined? The application of distributed spectrum sensing and available resource maps to cognitive radio systems Feedback schemes for multiuser MIMO-OFDM downlink
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1