采用速率分裂方法实现分布式CSI和非相同链路衰落mac的自适应和容量

Sreejith Sreekumar
{"title":"采用速率分裂方法实现分布式CSI和非相同链路衰落mac的自适应和容量","authors":"Sreejith Sreekumar","doi":"10.1109/NCC.2013.6487955","DOIUrl":null,"url":null,"abstract":"We consider a two user slow fading Gaussian MAC where each transmitter knows only its own channel fading coefficient prior to transmission and where the receiver knows the fading coefficients of both users. The slow fading channel is modeled as a block fading channel. Each user performs block by block encoding for communication with the common receiver. The receiver decodes the messages of both users from the received signal, also on a block by block basis. Each user has its own fixed average power constraint in each block. A useful metric to measure the throughput performance in such a scenario is the adaptive sum capacity which is the maximum expected sum throughput that can be achieved. The adaptive sum capacity in such a setting was derived by the authors in [4]. We show that the adaptive sum capacity can be achieved by an asymptotically optimal rate-splitting scheme with low complexity single-user decoding. This eliminates the need for joint decoding of the two users which, although optimal, has a high complexity.","PeriodicalId":202526,"journal":{"name":"2013 National Conference on Communications (NCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Achieving Adaptive sum-capacity of fading MACs with distributed CSI and non-identical links by rate-splitting\",\"authors\":\"Sreejith Sreekumar\",\"doi\":\"10.1109/NCC.2013.6487955\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider a two user slow fading Gaussian MAC where each transmitter knows only its own channel fading coefficient prior to transmission and where the receiver knows the fading coefficients of both users. The slow fading channel is modeled as a block fading channel. Each user performs block by block encoding for communication with the common receiver. The receiver decodes the messages of both users from the received signal, also on a block by block basis. Each user has its own fixed average power constraint in each block. A useful metric to measure the throughput performance in such a scenario is the adaptive sum capacity which is the maximum expected sum throughput that can be achieved. The adaptive sum capacity in such a setting was derived by the authors in [4]. We show that the adaptive sum capacity can be achieved by an asymptotically optimal rate-splitting scheme with low complexity single-user decoding. This eliminates the need for joint decoding of the two users which, although optimal, has a high complexity.\",\"PeriodicalId\":202526,\"journal\":{\"name\":\"2013 National Conference on Communications (NCC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-03-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 National Conference on Communications (NCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NCC.2013.6487955\",\"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 National Conference on Communications (NCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCC.2013.6487955","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

我们考虑一个双用户慢衰落高斯MAC,其中每个发送者在传输前只知道自己的信道衰落系数,而接收器知道两个用户的衰落系数。将慢衰落信道建模为块衰落信道。每个用户执行块对块的编码,以便与公共接收器通信。接收器从接收到的信号对两个用户的消息进行解码,也是以块为基础的。每个用户在每个区块中都有自己固定的平均功率约束。在这种场景中,衡量吞吐量性能的一个有用指标是自适应总和容量,它是可以实现的最大预期总和吞吐量。在这种情况下的自适应和容量由作者在b[4]中导出。我们证明了自适应和容量可以通过低复杂度单用户解码的渐近最优速率分割方案来实现。这消除了对两个用户进行联合解码的需要,虽然这是最佳的,但具有很高的复杂性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Achieving Adaptive sum-capacity of fading MACs with distributed CSI and non-identical links by rate-splitting
We consider a two user slow fading Gaussian MAC where each transmitter knows only its own channel fading coefficient prior to transmission and where the receiver knows the fading coefficients of both users. The slow fading channel is modeled as a block fading channel. Each user performs block by block encoding for communication with the common receiver. The receiver decodes the messages of both users from the received signal, also on a block by block basis. Each user has its own fixed average power constraint in each block. A useful metric to measure the throughput performance in such a scenario is the adaptive sum capacity which is the maximum expected sum throughput that can be achieved. The adaptive sum capacity in such a setting was derived by the authors in [4]. We show that the adaptive sum capacity can be achieved by an asymptotically optimal rate-splitting scheme with low complexity single-user decoding. This eliminates the need for joint decoding of the two users which, although optimal, has a high complexity.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信