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

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((loglogSNR)/sup 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 loglogSNR.

[1]  Upamanyu Madhow,et al.  Reduced-Complexity Noncoherent Communication with Differential QAM and Iterative Receiver Processing , 2022 .

[2]  Upamanyu Madhow,et al.  Joint noncoherent demodulation and decoding for the block fading channel: a practical framework for approaching Shannon capacity , 2003, IEEE Trans. Commun..

[3]  S. Shamai,et al.  Fading channels: how perfect need "perfect side information" be? , 1999, Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253).

[4]  Ibrahim C. Abou-Faycal,et al.  The capacity of discrete-time memoryless Rayleigh-fading channels , 2001, IEEE Trans. Inf. Theory.

[5]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[6]  A. Lapidoth,et al.  Convex-programming bounds on the capacity of flat-fading channels , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[7]  Joint noncoherent demodulation and decoding for fast Rayleigh fading channels , 2003 .

[8]  S. Shamai,et al.  Iterative decoding for coded noncoherent MPSK communications over phase-noisy AWGN channel , 2000 .

[9]  Robert M. Gray,et al.  On the asymptotic eigenvalue distribution of Toeplitz matrices , 1972, IEEE Trans. Inf. Theory.

[10]  Thomas L. Marzetta,et al.  Capacity of a Mobile Multiple-Antenna Communication Link in Rayleigh Flat Fading , 1999, IEEE Trans. Inf. Theory.

[11]  Amiel Feinstein,et al.  Information and information stability of random variables and processes , 1964 .

[12]  Shlomo Shamai,et al.  Fading Channels: Information-Theoretic and Communication Aspects , 1998, IEEE Trans. Inf. Theory.

[13]  V. Veeravalli,et al.  Capacity of noncoherent time-selective block Rayleigh flat-fading channel , 2002, Proceedings IEEE International Symposium on Information Theory,.

[14]  G. Taricco,et al.  Capacity of fading channel with no side information , 1997 .

[15]  Amos Lapidoth,et al.  Capacity bounds via duality with applications to multiple-antenna systems on flat-fading channels , 2003, IEEE Trans. Inf. Theory.