Achievable Rates for Discrete Memoryless Multicast Networks With and Without Feedback
2018-04
发表期刊IEEE TRANSACTIONS ON INFORMATION THEORY (IF:2.2[JCR-2023],2.4[5-Year])
ISSN0018-9448
卷号64期号:4页码:2321-2332
发表状态已发表
DOI10.1109/TIT.2018.2789892
摘要Discrete memoryless multicast network (DM-MN) is considered in this paper. We analyze the lower bounds of noisy network coding (NNC) and distributed decode-forward (DDF) for DM-MN, and show that both NNC and DDF ignore the channel output observed at the transmitter. Motivated by this observation, new coding schemes are proposed to improve NNC and DDF by exploiting the transmitter's observation and applying hybrid relaying strategies. We first study a special case when the transmitter's observation is rate-limited feedback signals, and propose a scheme that strictly improves NNC when feedback rates are sufficiently large. For the relay channel with perfect relay-transmitter feedback, our achievable rate reduces to Gabbai and Bross's rate, which is strictly larger than NNC, DDF, and all known lower bounds on the achievable rates proposed for the setup without feedback. In our scheme, both relays and receivers compress their received signals like NNC, and the relays decode independent "common" and "private" parts of the source message. The generated compression indices are sent to the transmitter through feedback, from which the transmitter reconstructs the receivers' and relays' inputs and can thus cooperate with the receivers and relays. We then extend our idea to DM-MN without feedback. For this case, although the transmitter observes channel output, both NNC and DDF simply ignore it, while our new scheme has the transmitter utilize its channel output to decode a set of relays' and receivers' compression indices, which achieves some cooperation levels between the transmitter and the receivers and relays. An enhanced relay channel is introduced to show that our scheme strictly outperforms NNC and DDF.
关键词Multicast feedback rate-limited
URL查看原文
收录类别SCI ; SCIE ; CPCI
语种英语
WOS研究方向Computer Science ; Engineering
WOS类目Computer Science, Information Systems ; Engineering, Electrical & Electronic
WOS记录号WOS:000427857200010
出版者IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
WOS关键词RELAY CHANNEL ; CAPACITY THEOREMS
原始文献类型Article ; Proceedings Paper
来源库IEEE
引用统计
正在获取...
文献类型期刊论文
条目标识符https://kms.shanghaitech.edu.cn/handle/2MSLDSTB/20194
专题信息科学与技术学院
信息科学与技术学院_PI研究组_吴幼龙组
作者单位
School of Information Science and Technology, ShanghaiTech University, Shanghai, China
第一作者单位信息科学与技术学院
第一作者的第一单位信息科学与技术学院
推荐引用方式
GB/T 7714
Youlong Wu. Achievable Rates for Discrete Memoryless Multicast Networks With and Without Feedback[J]. IEEE TRANSACTIONS ON INFORMATION THEORY,2018,64(4):2321-2332.
APA Youlong Wu.(2018).Achievable Rates for Discrete Memoryless Multicast Networks With and Without Feedback.IEEE TRANSACTIONS ON INFORMATION THEORY,64(4),2321-2332.
MLA Youlong Wu."Achievable Rates for Discrete Memoryless Multicast Networks With and Without Feedback".IEEE TRANSACTIONS ON INFORMATION THEORY 64.4(2018):2321-2332.
条目包含的文件
文件名称/大小 文献类型 版本类型 开放类型 使用许可
个性服务
查看访问统计
谷歌学术
谷歌学术中相似的文章
[Youlong Wu]的文章
百度学术
百度学术中相似的文章
[Youlong Wu]的文章
必应学术
必应学术中相似的文章
[Youlong Wu]的文章
相关权益政策
暂无数据
收藏/分享
文件名: 20194.pdf
格式: Adobe PDF
此文件暂不支持浏览
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。