On the Fading Number of Multiple-Input Single-Output Fading Channels with Memory

We derive new upper and lower bounds on the fading number of non-coherent multiple-input single-output (MISO) fading channels of general (not necessarily Gaussian) regular law with spatial and temporal memory. The fading number is the second term, after the double-logarithmic term, of the high signal-to-noise ratio (SNR) expansion of channel capacity. In case of an isotropically distributed fading vector it is proven that the upper and lower bound coincide, i.e., the general MISO fading number with memory is known precisely. The upper and lower bounds show that a type of beam-forming is asymptotically optimal

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[17]  H. Priestley.  Introduction to Integration , 1997 .

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

[19]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

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

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

[22]  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,.

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

[24]  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).