On fixed input distributions for noncoherent communication over high-SNR Rayleigh-fading channels

被引:24
作者
Chen, RR [1 ]
Hajek, B
Koetter, R
Madhow, U
机构
[1] Univ Utah, Dept Elect & Comp Engn, Salt Lake City, UT 84112 USA
[2] Univ Illinois, Dept Elect & Comp Engn, Urbana, IL 61801 USA
[3] Univ Calif Santa Barbara, Dept Elect & Comp Engn, Santa Barbara, CA 93106 USA
基金
美国国家科学基金会;
关键词
channel capacity; fading channels; high signal-to-noise ratio (SNR); noncoherent communication; Rayleigh fading;
D O I
10.1109/TIT.2004.838356
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
It is well known that independent and identically distributed Gaussian inputs, scaled appropriately based on the signal-to-noise ratio (SNR), achieve capacity on the additive white Gaussian noise (AWGN) channel at all values of SNR. In this correspondence, we consider the question of whether such good input distributions exist for frequency-nonselective Rayleigh-fading channels, assuming that neither the transmitter nor the receiver has a priori knowledge of the fading coefficients. In this noncoherent regime, for a Gauss-Markov model of the fading channel, we obtain explicit mutual information bounds for the Gaussian input distribution. The fact that Gaussian input generates bounded mutual information motivates the search for better choices of fixed input distributions for high-rate transmission over rapidly varying channels. Necessary and sufficient conditions are derived for characterizing such distributions for the worst case scenario of memoryless fading, using the criterion that the mutual information is unbounded as the SNR gets large. Examples of both discrete and continuous distributions that satisfy these conditions are given. A family of fixed input distributions with mutual information growth rate of O((log log SNR)(1-u)), u > 0 are constructed. It is also proved that there does not exist a single fixed-input distribution that achieves the optimal mutual information growth rate of log log SNR.
引用
收藏
页码:3390 / 3396
页数:7
相关论文
共 12 条
[1]   The capacity of discrete-time memoryless Rayleigh-Fading channels [J].
Abou-Faycal, IC ;
Trott, MD ;
Shamai, S .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (04) :1290-1301
[2]   Joint noncoherent demodulation and decoding for the block fading channel: A practical framework for approaching Shannon capacity [J].
Chen, RR ;
Koetter, R ;
Madhow, U ;
Agrawal, D .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2003, 51 (10) :1676-1689
[3]  
CHEN RR, 2003, P 2003 C INF SCI SYS
[4]  
GRAY RM, 1972, IEEE T INFORM THEORY, V18, P725, DOI 10.1109/TIT.1972.1054924
[5]  
JACOBSEN N, 2003, P 2003 C INF SCI SYS
[6]   Capacity bounds via duality with applications to multiple-antenna systems on flat-fading channels [J].
Lapidoth, A ;
Moser, SM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (10) :2426-2467
[7]   Fading channels: how perfect need "perfect side information" be? [J].
Lapidoth, A ;
Shamai, S .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (05) :1118-1134
[8]  
LIANG Y, IN PRESS IEEE T INFO
[9]   Capacity of a mobile multiple-antenna communication link in Rayleigh flat fading [J].
Marzetta, TL ;
Hochwald, BM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (01) :139-157
[10]   Iterative decoding for coded noncoherent MPSK communications over phase-noisy AWGN channel [J].
Peleg, M ;
Shamai, S ;
Galán, S .
IEE PROCEEDINGS-COMMUNICATIONS, 2000, 147 (02) :87-95