Tight upper and lower bounds on the constrained capacity of non-coherent multi-antenna channels

K. Padmanabhan, S. Venkatraman, O. Collins
{"title":"Tight upper and lower bounds on the constrained capacity of non-coherent multi-antenna channels","authors":"K. Padmanabhan, S. Venkatraman, O. Collins","doi":"10.1109/ISIT.2008.4595459","DOIUrl":null,"url":null,"abstract":"This paper first presents an optimal receiver and coding scheme for a multi-user, multi-receiver, non-coherent Rayleigh flat fading channel which achieves the channel's constrained capacity (i.e., the capacity for a fixed input distribution). The paper then goes on to analyze the optimal receiver and uses it to generate tight upper and lower bounds on the constrained capacity. Knowing this constrained capacity is essential to judge the efficiency of coding schemes for the channel; it performs the same function as BPSK capacity for the AWGN channel in judging LDPC codes. The paper then goes on to present a practicable correlation based receiver that uses a novel iterative channel estimation technique. The performance of this receiver remains close to the constrained capacity as long as the per-user SNR is low; there is no requirement on the aggregate SNR. With 50 users, 50 receivers and a brickwall fading channel with a coherence length of 200 symbols, for example, the correlation based receiver achieves a sum rate of 36 bits/sec/Hz, significantly greater than any current cellular standards.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2008.4595459","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

This paper first presents an optimal receiver and coding scheme for a multi-user, multi-receiver, non-coherent Rayleigh flat fading channel which achieves the channel's constrained capacity (i.e., the capacity for a fixed input distribution). The paper then goes on to analyze the optimal receiver and uses it to generate tight upper and lower bounds on the constrained capacity. Knowing this constrained capacity is essential to judge the efficiency of coding schemes for the channel; it performs the same function as BPSK capacity for the AWGN channel in judging LDPC codes. The paper then goes on to present a practicable correlation based receiver that uses a novel iterative channel estimation technique. The performance of this receiver remains close to the constrained capacity as long as the per-user SNR is low; there is no requirement on the aggregate SNR. With 50 users, 50 receivers and a brickwall fading channel with a coherence length of 200 symbols, for example, the correlation based receiver achieves a sum rate of 36 bits/sec/Hz, significantly greater than any current cellular standards.
非相干多天线信道约束容量的严格上下界
本文首先提出了一种多用户、多接收机、非相干瑞利平坦衰落信道的最优接收端和编码方案,以实现信道的受限容量(即固定输入分布的容量)。然后分析了最优接收机,并用它来生成约束容量的紧上界和下界。了解这种受限容量对于判断信道编码方案的效率至关重要;它在AWGN信道中起到与BPSK容量相同的作用来判断LDPC码。然后,本文提出了一种实用的基于相关的接收机,该接收机采用了一种新颖的迭代信道估计技术。只要单用户信噪比较低,该接收机的性能就会接近受限容量;对总信噪比没有要求。例如,在50个用户、50个接收器和一个相干长度为200个符号的砖墙衰落信道的情况下,基于相关的接收器实现了36比特/秒/Hz的和速率,显著高于任何当前的蜂窝标准。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信