The capacity of discrete-time memoryless Rayleigh-fading channels
Top Cited Papers
- 1 May 2001
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 47 (4) , 1290-1301
- https://doi.org/10.1109/18.923716
Abstract
We consider transmission over a discrete-time Rayleigh fading channel, in which successive symbols face independent fading, and where neither the transmitter nor the receiver has channel state information. Subject to an average power constraint, we study the capacity-achieving distribution of this channel and prove it to be discrete with a finite number of mass points, one of them located at the origin. We numerically compute the capacity and the corresponding optimal distribution as a function of the signal-to-noise ratio (SNR). The behavior of the channel at low SNR is studied and finally a comparison is drawn with the ideal additive white Gaussian noise channel.Keywords
This publication has 13 references indexed in Scilit:
- Capacity of Markov channels with receiver CSI and delayed feedbackIEEE Transactions on Information Theory, 1999
- Capacity of fading channels with channel side informationIEEE Transactions on Information Theory, 1997
- Capacity of fading channelwith no side informationElectronics Letters, 1997
- The capacity of average and peak-power-limited quadrature Gaussian channelsIEEE Transactions on Information Theory, 1995
- Information theoretic considerations for cellular mobile radioIEEE Transactions on Vehicular Technology, 1994
- A mapping approach to rate-distortion computation and analysisIEEE Transactions on Information Theory, 1994
- On channel capacity per unit costIEEE Transactions on Information Theory, 1990
- The information capacity of amplitude- and variance-constrained sclar gaussian channelsInformation and Control, 1971
- A Gaussian channel with slow fading (Corresp.)IEEE Transactions on Information Theory, 1970
- A Mathematical Theory of CommunicationBell System Technical Journal, 1948