On noisy network coding for a Gaussian relay chain network with correlated noises

Lei Zhou, Wei Yu
{"title":"On noisy network coding for a Gaussian relay chain network with correlated noises","authors":"Lei Zhou, Wei Yu","doi":"10.1109/cwit.2011.5872129","DOIUrl":null,"url":null,"abstract":"Noisy network coding, which elegantly combines the conventional compress-and-forward relaying strategy and ideas from network coding, has recently drawn much attention for its simplicity and optimality in achieving to within constant gap of the capacity of the multisource multicast Gaussian network. The constant-gap result, however, applies only to Gaussian relay networks with independent noises. This paper investigates the application of noisy network coding to networks with correlated noises. By focusing on a four-node Gaussian relay chain network with a particular noise correlation structure, it is shown that noisy network coding can no longer achieve to within constant gap to capacity with the choice of Gaussian inputs and Gaussian quantization. The cut-set bound of the relay chain network in this particular case, however, can be achieved to within half a bit by a simple concatenation of a correlation-aware noisy network coding strategy and a decode-and-forward scheme.","PeriodicalId":250626,"journal":{"name":"2011 12th Canadian Workshop on Information Theory","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 12th Canadian Workshop on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/cwit.2011.5872129","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Noisy network coding, which elegantly combines the conventional compress-and-forward relaying strategy and ideas from network coding, has recently drawn much attention for its simplicity and optimality in achieving to within constant gap of the capacity of the multisource multicast Gaussian network. The constant-gap result, however, applies only to Gaussian relay networks with independent noises. This paper investigates the application of noisy network coding to networks with correlated noises. By focusing on a four-node Gaussian relay chain network with a particular noise correlation structure, it is shown that noisy network coding can no longer achieve to within constant gap to capacity with the choice of Gaussian inputs and Gaussian quantization. The cut-set bound of the relay chain network in this particular case, however, can be achieved to within half a bit by a simple concatenation of a correlation-aware noisy network coding strategy and a decode-and-forward scheme.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有相关噪声的高斯中继链网络的噪声网络编码
噪声网络编码将传统的压缩转发中继策略和网络编码思想巧妙地结合在一起,以其简单性和最优性在多源多播高斯网络容量的恒定间隙内得到了广泛的关注。然而,恒定间隙的结果只适用于具有独立噪声的高斯中继网络。本文研究了噪声网络编码在相关噪声网络中的应用。以具有特定噪声相关结构的四节点高斯中继链网络为研究对象,研究了选择高斯输入和高斯量化后,噪声网络编码不能实现容量恒定间隙的问题。然而,在这种特殊情况下,中继链网络的切集边界可以通过关联感知噪声网络编码策略和解码转发方案的简单连接来实现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Sparse space codes for multi-antenna systems Average outage and non-outage duration of selective decode-and-forward relaying Complexity-efficient detection for MIMO relay networks DMT analysis of multi-hop coherent FSO communication over atmospheric channels Optimizing wireless network resource allocation
×
引用
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