用于有N个中继的网络的部分解码转发方案

Yao Tang, M. Vu
{"title":"用于有N个中继的网络的部分解码转发方案","authors":"Yao Tang, M. Vu","doi":"10.1109/CISS.2013.6552262","DOIUrl":null,"url":null,"abstract":"We study a discrete-memoryless relay network consisting of one source, one destination and N relays, and design a scheme based on partial decode-forward relaying. The source splits its message into one common and N + 1 private parts, one intended for each relay. It encodes these message parts using Nth-order block Markov coding, in which each private message part is independently superimposed on the common parts of the current and N previous blocks. Using simultaneous sliding window decoding, each relay fully recovers the common message and its intended private message with the same block index, then forwards them to the following nodes in the next block. This scheme can be applied to any network topology. We derive its achievable rate in a compact form. The result reduces to a known decode-forward lower bound for an N-relay network and partial decode-forward lower bound for a two-level relay network. We then apply the scheme to a Gaussian two-level relay network and obtain its capacity lower bound considering power constraints at the transmitting nodes.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A partial decode-forward scheme for a network with N relays\",\"authors\":\"Yao Tang, M. Vu\",\"doi\":\"10.1109/CISS.2013.6552262\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study a discrete-memoryless relay network consisting of one source, one destination and N relays, and design a scheme based on partial decode-forward relaying. The source splits its message into one common and N + 1 private parts, one intended for each relay. It encodes these message parts using Nth-order block Markov coding, in which each private message part is independently superimposed on the common parts of the current and N previous blocks. Using simultaneous sliding window decoding, each relay fully recovers the common message and its intended private message with the same block index, then forwards them to the following nodes in the next block. This scheme can be applied to any network topology. We derive its achievable rate in a compact form. The result reduces to a known decode-forward lower bound for an N-relay network and partial decode-forward lower bound for a two-level relay network. We then apply the scheme to a Gaussian two-level relay network and obtain its capacity lower bound considering power constraints at the transmitting nodes.\",\"PeriodicalId\":268095,\"journal\":{\"name\":\"2013 47th Annual Conference on Information Sciences and Systems (CISS)\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-03-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 47th Annual Conference on Information Sciences and Systems (CISS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CISS.2013.6552262\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISS.2013.6552262","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

研究了一个由一个源、一个目的和N个中继组成的离散无记忆中继网络,并设计了一种基于部分译码转发的中继方案。源将其消息分成一个公共部分和N + 1个私有部分,每个中继一个。它使用N阶块马尔可夫编码对这些消息部分进行编码,其中每个私有消息部分独立地叠加在当前和前N个块的公共部分上。使用同步滑动窗口解码,每个中继完全恢复具有相同块索引的公共消息及其预期的私有消息,然后将它们转发到下一个块中的以下节点。该方案适用于任何网络拓扑。我们以紧致形式推导出它的可达速率。结果简化为n中继网络的已知正向译码下界和两级中继网络的部分正向译码下界。然后将该方案应用于高斯二电平中继网络,在考虑传输节点功率约束的情况下,得到了该网络的容量下界。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A partial decode-forward scheme for a network with N relays
We study a discrete-memoryless relay network consisting of one source, one destination and N relays, and design a scheme based on partial decode-forward relaying. The source splits its message into one common and N + 1 private parts, one intended for each relay. It encodes these message parts using Nth-order block Markov coding, in which each private message part is independently superimposed on the common parts of the current and N previous blocks. Using simultaneous sliding window decoding, each relay fully recovers the common message and its intended private message with the same block index, then forwards them to the following nodes in the next block. This scheme can be applied to any network topology. We derive its achievable rate in a compact form. The result reduces to a known decode-forward lower bound for an N-relay network and partial decode-forward lower bound for a two-level relay network. We then apply the scheme to a Gaussian two-level relay network and obtain its capacity lower bound considering power constraints at the transmitting nodes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
UCS-WN: An unbiased compressive sensing framework for weighted networks Degrees-of-freedom and interference tradeoff for a mix-Gaussian cognitive radio channel Audio-visual saliency map: Overview, basic models and hardware implementation Proactive versus reactive revisited: IPv6 routing for Low Power Lossy Networks Secrecy enhancement of block ciphered systems with deliberate noise in Non-coherent scenario
×
引用
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