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

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

非相干多天线信道受限容量的严格上限和下限

DOI:
10.1109/isit.2008.4595459
复制
发表时间:
2008
期刊:
2008 IEEE International Symposium on Information Theory
影响因子:
--
通讯作者:
O. Collins
O. Collins
中科院分区:
--
文献类型:
--
作者:
K. Padmanabhan;Sundeep Venkatraman;O. Collins

文献摘要

参考文献

被引文献

相似文献

本文首先提出了一种多用户、多接收机、非相干瑞利平坦衰落信道的最优接收机和编码方案,该方案实现了信道容量的约束(即,固定输入分布的容量)。然后,本文继续分析的最佳接收器,并使用它来产生严格的上限和下限的约束容量。知道这个约束容量对于判断信道的编码方案的效率是必不可少的;它在判断LDPC码时执行与AWGN信道的BPSK容量相同的功能。然后,本文提出了一种实用的相关接收机,使用一种新的迭代信道估计技术。该接收机的性能保持接近的约束容量,只要每用户的SNR是低的,没有对聚合SNR的要求。例如,对于50个用户、50个接收机和相干长度为200个符号的砖墙衰落信道,基于相关的接收机实现了36比特/秒/Hz的总速率,明显大于任何当前的蜂窝标准。
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.
DOI: --
发表时间: 2009
期刊:
影响因子: --
作者:
T.Ashikaga;K.-I.Yoshikawa;M. Uchida and N. Yoshida;T. Kato;Hiroshi Ohta;藤原耕二;T. Tsuboi;K.-I. Yoshikawa;N. Yoshida
通讯作者: N. Yoshida