On the Fundamental Limits of Cooperative Multiple-Access Channels with Distributed CSIT

Lorenzo Miretti, Paul de Kerret, D. Gesbert
{"title":"On the Fundamental Limits of Cooperative Multiple-Access Channels with Distributed CSIT","authors":"Lorenzo Miretti, Paul de Kerret, D. Gesbert","doi":"10.1109/ITW44776.2019.8989227","DOIUrl":null,"url":null,"abstract":"The availability of accurate and, most importantly, shared channel state information at the transmitter (CSIT) is one of the key factors that enable transmitters cooperation in decentralized wireless systems. However, in some cases, channel information may not be easily or perfectly shared among the transmitters, thus limiting their coordination capabilities. In this paper we shed some light on the fundamental limits of networks with cooperating transmitters impaired by a general distributed CSIT assumption. To this end, we consider a state-dependent memory-less multiple-access channel with common message, and with noisy causal CSIT and noisy channel state information at the receiver (CSIR). Perhaps surprisingly, and in contrast to the same setting in absence of common message, we show that distributed precoding based on current CSIT only (namely, a Shannon strategy) achieves the sum-rate capacity of this channel, for every degree of CSIT and CSIR. By focusing on the transmission of a common message only, we then illustrate this result in a practically relevant Gaussian setting.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"372 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE Information Theory Workshop (ITW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW44776.2019.8989227","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

The availability of accurate and, most importantly, shared channel state information at the transmitter (CSIT) is one of the key factors that enable transmitters cooperation in decentralized wireless systems. However, in some cases, channel information may not be easily or perfectly shared among the transmitters, thus limiting their coordination capabilities. In this paper we shed some light on the fundamental limits of networks with cooperating transmitters impaired by a general distributed CSIT assumption. To this end, we consider a state-dependent memory-less multiple-access channel with common message, and with noisy causal CSIT and noisy channel state information at the receiver (CSIR). Perhaps surprisingly, and in contrast to the same setting in absence of common message, we show that distributed precoding based on current CSIT only (namely, a Shannon strategy) achieves the sum-rate capacity of this channel, for every degree of CSIT and CSIR. By focusing on the transmission of a common message only, we then illustrate this result in a practically relevant Gaussian setting.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于分布式CSIT的合作多址信道的基本限制
在分散式无线系统中,发射机能否获得准确且最重要的共享信道状态信息是保证发射机合作的关键因素之一。然而,在某些情况下,信道信息可能不容易或不完美地在发射机之间共享,从而限制了它们的协调能力。在本文中,我们揭示了一些基本限制的合作发射机网络受损的一般分布式CSIT假设。为此,我们考虑了一个状态依赖的无内存多址信道,该信道具有公共消息,并且在接收端具有噪声因果CSIT和噪声信道状态信息(CSIR)。也许令人惊讶的是,与没有公共消息的相同设置相比,我们表明仅基于当前CSIT的分布式预编码(即香农策略)对于每个CSIT和CSIR程度都实现了该信道的和速率容量。通过只关注公共消息的传输,我们在实际相关的高斯设置中说明了这一结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Increasing the Lifetime of Flash Memories Using Multi-Dimensional Graph-Based Codes Channel Coding at Low Capacity LDPC Code Design for Delayed Bit-Interleaved Coded Modulation Multi-library Coded Caching with Partial Secrecy Optimal Broadcast Rate of a Class of Two-Sender Unicast Index Coding Problems
×
引用
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