Multihop virtual full-duplex relay channels

Songnam Hong, I. Marić, D. Hui, G. Caire
{"title":"Multihop virtual full-duplex relay channels","authors":"Songnam Hong, I. Marić, D. Hui, G. Caire","doi":"10.1109/ITW.2015.7133148","DOIUrl":null,"url":null,"abstract":"We introduce a multihop “virtual” full-duplex relay channel as a special case of a general multiple multicast relay network. For such network, quantize-map-and-forward (QMF) (or noisy network coding (NNC)) can achieve the cut-set upper bound within a constant gap where the gap grows linearly with the number of relay stages K. However, this gap may not be negligible for the systems with multihop transmissions (e.g., a power-limited wireless backhaul system operating at high frequencies). In this paper, we obtain an improved result to the capacity scaling where the gap grows logarithmically as log (K). This is achieved by using an optimal quantization at relays and by exploiting relays' messages (decoded in the previous time slot) as side-information at the destination. We further improve the performance of this network by presenting a mixed strategy where each relay can perform either decode-and-forward (DF) or QMF with possibly rate-splitting.","PeriodicalId":174797,"journal":{"name":"2015 IEEE Information Theory Workshop (ITW)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE Information Theory Workshop (ITW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW.2015.7133148","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

We introduce a multihop “virtual” full-duplex relay channel as a special case of a general multiple multicast relay network. For such network, quantize-map-and-forward (QMF) (or noisy network coding (NNC)) can achieve the cut-set upper bound within a constant gap where the gap grows linearly with the number of relay stages K. However, this gap may not be negligible for the systems with multihop transmissions (e.g., a power-limited wireless backhaul system operating at high frequencies). In this paper, we obtain an improved result to the capacity scaling where the gap grows logarithmically as log (K). This is achieved by using an optimal quantization at relays and by exploiting relays' messages (decoded in the previous time slot) as side-information at the destination. We further improve the performance of this network by presenting a mixed strategy where each relay can perform either decode-and-forward (DF) or QMF with possibly rate-splitting.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
多跳虚拟全双工中继信道
本文介绍了一种多跳“虚拟”全双工中继信道,作为一般多组播中继网络的一种特例。对于这样的网络,量化映射转发(QMF)(或噪声网络编码(NNC))可以在一个恒定的间隙内实现截集上限,其中间隙随着中继级k的数量线性增长。然而,对于具有多跳传输的系统(例如,在高频下工作的功率有限的无线回程系统),这个间隙可能不可忽略。在本文中,我们获得了容量缩放的改进结果,其中间隙以对数方式增长为log (K)。这是通过在中继上使用最佳量化并利用中继的消息(在前一个时隙中解码)作为目的地的侧信息来实现的。我们通过提出一种混合策略进一步提高了该网络的性能,其中每个中继可以执行译码转发(DF)或QMF,并可能进行速率分裂。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Degraded broadcast channel: Secrecy outside of a bounded range On compute-and-forward with feedback On the capacity of multihop device-to-device caching networks Lattice index coding for the broadcast channel On the transmission of a bivariate Gaussian source over the Gaussian broadcast channel with feedback
×
引用
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