Multi-terminal source coding through a relay

R. Soundararajan, S. Vishwanath
{"title":"Multi-terminal source coding through a relay","authors":"R. Soundararajan, S. Vishwanath","doi":"10.1109/ISIT.2011.6033874","DOIUrl":null,"url":null,"abstract":"This paper studies a multi-terminal source coding problem, where two terminals possess two (correlated) Gaussian sources to be compressed and delivered to the destination through an intermediate relay. Unlike the CEO and conventional two-terminal source coding problems as well as point-to-point relay source coding problem, lattices are found to play an important role in achieving #x201C;good#x201D; rates for this problem setting. Two achievable strategies - compute-and-forward and compress-and-forward are used to develop achievable rates for this problem setting. For the symmetric case, the inner and outer bounds developed are shown to be within 1/2 bits of each other.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE International Symposium on Information Theory Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2011.6033874","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

This paper studies a multi-terminal source coding problem, where two terminals possess two (correlated) Gaussian sources to be compressed and delivered to the destination through an intermediate relay. Unlike the CEO and conventional two-terminal source coding problems as well as point-to-point relay source coding problem, lattices are found to play an important role in achieving #x201C;good#x201D; rates for this problem setting. Two achievable strategies - compute-and-forward and compress-and-forward are used to develop achievable rates for this problem setting. For the symmetric case, the inner and outer bounds developed are shown to be within 1/2 bits of each other.
通过继电器进行多终端源编码
本文研究了一个多终端信源编码问题,其中两个终端拥有两个(相关的)高斯信源,通过中间中继压缩并传送到目的地。与CEO和传统的双端源编码问题以及点对点中继源编码问题不同,格在实现#x201C;良好#x201D;此问题设置的费率。两种可实现的策略-计算-转发和压缩-转发被用来为这个问题设定可实现的速率。对于对称情况,所开发的内界和外界显示在彼此的1/2位以内。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信