The Fading Number of Memoryless Multiple-Input Multiple-Output Fading Channels

In this correspondence, we derive the fading number of multiple-input multiple-output (MIMO) flat-fading channels of general (not necessarily Gaussian) regular law without temporal memory. The channel is assumed to be noncoherent, i.e., neither receiver nor transmitter have knowledge about the channel state, but they only know the probability law of the fading process. The fading number is the second term, after the double-logarithmic term, of the high signal-to-noise ratio (SNR) expansion of channel capacity. Hence, the asymptotic channel capacity of memoryless MIMO fading channels is derived exactly. The result is then specialized to the known cases of single-input-multiple-output (SIMO), multiple-input single-output (MISO), and single-input-single-output (SISO) fading channels, as well as to the situation of Gaussian fading.

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

[2]  Tobias Koch.  On the Asymptotic Capacity of Multiple-Input Single-Output Fading Channels with Memory , 2004 .

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

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

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

[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]  Tsachy Weissman,et al.  On the optimality of symbol-by-symbol filtering and denoising , 2004, IEEE Transactions on Information Theory.

[8]  Eytan Domany,et al.  From Finite-System Entropy to Entropy Rate for a Hidden Markov Process , 2006, IEEE Signal Processing Letters.

[9]  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..

[10]  Amos Lapidoth,et al.  On the Asymptotic Capacity of Multiple-Input Single-Output Fading Channels with Memory , 2004 .

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

[12]  Amos Lapidoth,et al.  The fading number of single-input multiple-output fading channels with memory , 2006, IEEE Transactions on Information Theory.

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

[14]  Andrea J. Goldsmith,et al.  Capacity of Finite State Channels Based on Lyapunov Exponents of Random Matrices , 2006, IEEE Transactions on Information Theory.

[15]  Amos Lapidoth,et al.  On Non-Coherent Fading Channels with Feedback , 2005 .

[16]  Amos Lapidoth,et al.  The Fading Number of SIMO Fading Channels with Memory , 2004 .

[17]  Venkat Anantharam,et al.  An upper bound for the largest Lyapunov exponent of a Markovian product of nonnegative matrices , 2005, Theor. Comput. Sci..

[18]  Amos Lapidoth,et al.  Degrees of Freedom in Non-Coherent Stationary MIMO Fading Channels , 2005 .

[19]  Eytan Domany,et al.  Asymptotics of the entropy rate for a hidden Markov process , 2005, Data Compression Conference.

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

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

[22]  A. Lapidoth,et al.  Feedback increases neither the fading number nor the pre-log , 2004, 2004 23rd IEEE Convention of Electrical and Electronics Engineers in Israel.

[23]  Amos Lapidoth.  On the high-SNR capacity of noncoherent networks , 2005, IEEE Transactions on Information Theory.

[24]  Amos Lapidoth,et al.  On the Capacity of the Discrete-Time Poisson Channel , 2009, IEEE Transactions on Information Theory.

[25]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

[26]  Philippe Jacquet,et al.  On the entropy of a hidden Markov process , 2004, Data Compression Conference, 2004. Proceedings. DCC 2004.

[27]  Amos Lapidoth,et al.  On the fading number of multi-antenna systems , 2001, Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494).

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

[29]  Amos Lapidoth,et al.  On the fading number of multi-antenna systems over flat fading channels with memory and incomplete side information , 2002, Proceedings IEEE International Symposium on Information Theory,.