Minimum energy to send k bits over Rayleigh-fading channels

This paper investigates the minimum energy required to transmit, with a given reliability, k information bits over a stationary memoryless Rayleigh-fading channel, under the assumption that neither the transmitter nor the receiver have a priori channel state information (CSI). It is well known that the ratio between the minimum energy per bit and the noise level converges to -1.59 dB as k goes to infinity, regardless of whether CSI is available at the receiver or not. This paper shows that lack of CSI at the receiver causes a slowdown in the speed of convergence to -1.59 dB as k → ∞ compared to the case of perfect receiver CSI. Specifically, we show that in the noCSI case, the gap to -1.59 dB is proportional to ((log k)/k)1/3, whereas when perfect CSI is available at the receiver, this gap is '/ proportional to 1/√(k). Numerically, we observe that to achieve an energy per bit of -1.5 dB in the no-CSI case, one needs to transmit at least 7 × 107 information bits, whereas 6 × 104 bits suffice for the case of perfect CSI at the receiver (same number of bits as for nonfading AWGN channels). Interestingly, all results (asymptotic and numerical) are unchanged if multiple transmit antennas and/or block fading is assumed.

[1]  E. S. Pearson,et al.  On the Problem of the Most Efficient Tests of Statistical Hypotheses , 1933 .

[2]  H. Vincent Poor,et al.  Channel Coding Rate in the Finite Blocklength Regime , 2010, IEEE Transactions on Information Theory.

[3]  Shao-Lun Huang,et al.  Proof of the Outage Probability Conjecture for MISO Channels , 2013, IEEE Transactions on Information Theory.

[4]  Emre Telatar,et al.  Capacity and mutual information of wideband multipath fading channels , 1998, IEEE Trans. Inf. Theory.

[5]  Robert Spayde Kennedy,et al.  Fading dispersive communication channels , 1969 .

[6]  H. Vincent Poor,et al.  Minimum Energy to Send $k$ Bits Through the Gaussian Channel With and Without Feedback , 2011, IEEE Transactions on Information Theory.

[7]  Sergio Verdú,et al.  Spectral efficiency in the wideband regime , 2002, IEEE Trans. Inf. Theory.

[8]  Vincent Yan Fu Tan,et al.  Asymptotic Estimates in Information Theory with Non-Vanishing Error Probabilities , 2014, Found. Trends Commun. Inf. Theory.

[9]  Shlomo Shamai,et al.  Noncoherent Capacity of Underspread Fading Channels , 2008, IEEE Transactions on Information Theory.

[10]  Sergio Verdú,et al.  Scalar coherent fading channel: Dispersion analysis , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[11]  Muriel Médard,et al.  Channel Coherence in the Low-SNR Regime , 2007, IEEE Transactions on Information Theory.

[12]  Giuseppe Durisi,et al.  Quasi-Static Multiple-Antenna Fading Channels at Finite Blocklength , 2013, IEEE Transactions on Information Theory.

[13]  Sergio Verdú,et al.  On channel capacity per unit cost , 1990, IEEE Trans. Inf. Theory.

[14]  Yury Polyanskiy,et al.  Orthogonal designs optimize achievable dispersion for coherent MISO channels , 2014, 2014 IEEE International Symposium on Information Theory.

[15]  Giuseppe Durisi,et al.  Diversity versus channel knowledge at finite block-length , 2012, 2012 IEEE Information Theory Workshop.

[16]  Muriel Médard,et al.  Bandwidth scaling for fading multipath channels , 2002, IEEE Trans. Inf. Theory.

[17]  B. Hajek,et al.  Capacity per unit energy of fading channels with a peak constraint , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[18]  E. S. Pearson,et al.  On the Problem of the Most Efficient Tests of Statistical Hypotheses , 1933 .