The fading number of single-input multiple-output fading channels with memory

We derive the fading number of stationary and ergodic (not necessarily Gaussian) single-input multiple-output (SIMO) fading channels with memory. This is the second term, after the double-logarithmic term, of the high signal-to-noise ratio (SNR) expansion of channel capacity. The transmitter and receiver are assumed to be cognizant of the probability law governing the fading but not of its realization. It is demonstrated that the fading number is achieved by independent and identically distributed (i.i.d.) circularly symmetric inputs of squared magnitude whose logarithm is uniformly distributed over an SNR-dependent interval. The upper limit of the interval is the logarithm of the allowed transmit power, and the lower limit tends to infinity sublogarithmically in the SNR. The converse relies inter alia on a new observation regarding input distributions that escape to infinity. Lower and upper bounds on the fading number for Gaussian fading are also presented. These are related to the mean squared-errors of the one-step predictor and the one-gap interpolator of the fading process respectively. The bounds are computed explicitly for stationary mth-order autoregressive AR(m) Gaussian fading processes.

[1]  David Tse,et al.  Degrees of freedom in underspread mimo fading channels , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

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

[3]  Amos Lapidoth,et al.  The Asymptotic Capacity of the Discrete-Time Poisson Channel , 2003 .

[4]  A. Yaglom,et al.  An Introduction to the Theory of Stationary Random Functions , 1963 .

[5]  Amos Lapidoth,et al.  On the asymptotic capacity of stationary Gaussian fading channels , 2005, IEEE Transactions on Information Theory.

[6]  A. N. Kolmogorov,et al.  Interpolation and extrapolation of stationary random sequences. , 1962 .

[7]  David Tse,et al.  Degrees of freedom in some underspread MIMO fading channels , 2006, IEEE Transactions on Information Theory.

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

[9]  Amos Lapidoth,et al.  Capacity Bounds Via Duality: A Phase Noise Example , 2002 .

[10]  Stefan M. Moser Duality-based bounds on channel capacity , 2005 .

[11]  E. Parzen Foundations of Time Series Analysis and Prediction Theory , 2002 .

[12]  Emre Telatar,et al.  Capacity of Multi-antenna Gaussian Channels , 1999, Eur. Trans. Telecommun..

[13]  Lizhong Zheng,et al.  Communication on the Grassmann manifold: A geometric approach to the noncoherent multiple-antenna channel , 2002, IEEE Trans. Inf. Theory.

[14]  Stefan M. Moser The Fading Number of Memoryless Multiple-Input Multiple-Output Fading Channels , 2007, IEEE Transactions on Information Theory.

[15]  D. A. Bell,et al.  Information Theory and Reliable Communication , 1969 .

[16]  Amos Lapidoth On the High SNR Capacity of Stationary Gaussian Fading Channels , 2003 .

[17]  Amos Lapidoth On phase noise channels at high SNR , 2002, Proceedings of the IEEE Information Theory Workshop.

[18]  Jiři Anděl A Comparison of Methods for Interpolation in Time Series , 1985 .

[19]  Yingbin Liang,et al.  Capacity of noncoherent time-selective Rayleigh-fading channels , 2004, IEEE Transactions on Information Theory.

[20]  W. C. Jakes,et al.  Microwave Mobile Communications , 1974 .

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

[22]  Amos Lapidoth,et al.  The fading number and degrees of freedom in non-coherent MIMO fading channels: a peace pipe , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..