具有间歇反馈的Erasure广播信道容量结果

Alireza Vahid, I-Hsiang Wang, Shih-Chun Lin
{"title":"具有间歇反馈的Erasure广播信道容量结果","authors":"Alireza Vahid, I-Hsiang Wang, Shih-Chun Lin","doi":"10.1109/ITW44776.2019.8989343","DOIUrl":null,"url":null,"abstract":"Recently, we showed that, rather surprisingly, the capacity region of the two-user erasure broadcast channel with global delayed channel state information (CSI) can be achieved with single-user delayed CSI only. More precisely, we assumed one receiver does not provide its channel state to the other two nodes (the other receiver and the transmitter), while the other receiver reveals its state globally with unit delay. In this work, we consider a more general setting in which feedback links are intermittent. To be precise, at any time instant, each receiver broadcasts its CSI, and this information either becomes available to the other two nodes or gets erased. For this setting, we develop a new set of outer bounds to capture the intermittent nature of the feedback links. These outer bounds depend on the probability that both feedback links are erased rather than the individual erasure probability of each feedback link. This result matches our earlier findings for the single-user delayed CSI scenario. We also provide a capacity-achieving recursive communication protocol for the scenario in which feedback links are fully correlated.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Capacity Results for Erasure Broadcast Channels with Intermittent Feedback\",\"authors\":\"Alireza Vahid, I-Hsiang Wang, Shih-Chun Lin\",\"doi\":\"10.1109/ITW44776.2019.8989343\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recently, we showed that, rather surprisingly, the capacity region of the two-user erasure broadcast channel with global delayed channel state information (CSI) can be achieved with single-user delayed CSI only. More precisely, we assumed one receiver does not provide its channel state to the other two nodes (the other receiver and the transmitter), while the other receiver reveals its state globally with unit delay. In this work, we consider a more general setting in which feedback links are intermittent. To be precise, at any time instant, each receiver broadcasts its CSI, and this information either becomes available to the other two nodes or gets erased. For this setting, we develop a new set of outer bounds to capture the intermittent nature of the feedback links. These outer bounds depend on the probability that both feedback links are erased rather than the individual erasure probability of each feedback link. This result matches our earlier findings for the single-user delayed CSI scenario. We also provide a capacity-achieving recursive communication protocol for the scenario in which feedback links are fully correlated.\",\"PeriodicalId\":214379,\"journal\":{\"name\":\"2019 IEEE Information Theory Workshop (ITW)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE Information Theory Workshop (ITW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW44776.2019.8989343\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE Information Theory Workshop (ITW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW44776.2019.8989343","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

最近,我们令人惊讶地发现,具有全局延迟信道状态信息(CSI)的双用户擦除广播信道的容量区域可以仅用单用户延迟CSI实现。更准确地说,我们假设一个接收器不向其他两个节点(另一个接收器和发送器)提供其信道状态,而另一个接收器以单位延迟全局显示其状态。在这项工作中,我们考虑一个更一般的设置,其中反馈链接是间歇性的。确切地说,在任何时刻,每个接收器都会广播其CSI,并且该信息要么可供其他两个节点使用,要么被擦除。对于这种设置,我们开发了一组新的外部边界来捕捉反馈链接的间歇性。这些外部边界取决于两个反馈链接被擦除的概率,而不是每个反馈链接的单个擦除概率。这个结果与我们早期对单用户延迟CSI场景的发现相匹配。我们还为反馈链接完全相关的场景提供了一种容量实现递归通信协议。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Capacity Results for Erasure Broadcast Channels with Intermittent Feedback
Recently, we showed that, rather surprisingly, the capacity region of the two-user erasure broadcast channel with global delayed channel state information (CSI) can be achieved with single-user delayed CSI only. More precisely, we assumed one receiver does not provide its channel state to the other two nodes (the other receiver and the transmitter), while the other receiver reveals its state globally with unit delay. In this work, we consider a more general setting in which feedback links are intermittent. To be precise, at any time instant, each receiver broadcasts its CSI, and this information either becomes available to the other two nodes or gets erased. For this setting, we develop a new set of outer bounds to capture the intermittent nature of the feedback links. These outer bounds depend on the probability that both feedback links are erased rather than the individual erasure probability of each feedback link. This result matches our earlier findings for the single-user delayed CSI scenario. We also provide a capacity-achieving recursive communication protocol for the scenario in which feedback links are fully correlated.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信