Bounds on the fading number of multiple-input single-output fading channels with memory

Authors:
Stefan M. Moser
Affiliations:
National Chiao Tung University, Hsinchu, Taiwan
Venue:
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Year:
2006

Citing 5
Cited 1

Matrix analysis

Matrix analysis
Capacity bounds via duality with applications to multiple-antenna systems on flat-fading channels

IEEE Transactions on Information Theory
Capacity of noncoherent time-selective Rayleigh-fading channels

IEEE Transactions on Information Theory
On the asymptotic capacity of stationary Gaussian fading channels

IEEE Transactions on Information Theory
The fading number of single-input multiple-output fading channels with memory

IEEE Transactions on Information Theory

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

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.06

Visualization

Abstract

We derive new upper and lower bounds on the fading number of 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.