Isotropic Fading Vector Broadcast Channels: The Scalar Upper Bound and Loss in Degrees of Freedom
- 28 February 2005
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 51 (3) , 848-857
- https://doi.org/10.1109/tit.2004.842621
Abstract
We propose a scalar upper bound on the capacity region of the isotropic fading vector broadcast channel in terms of the capacity region of a scalar fading broadcast channel. The scalar upper bound is applicable to the broad class of isotropic fading broadcast channels regardless of the distribution of the users' channel magnitudes, the distribution of the additive noise experienced by each user, or the amount of channel knowledge available at the receiver. Using this upper bound, we prove the optimality of the Alamouti scheme in a broadcast setting, extend the recent results on the capacity of nondegraded, fading scalar broadcast channels to nondegraded fading vector broadcast channels, and determine the capacity region of a fading vector Gaussian broadcast channel with channel magnitude feedback. We also provide an example of a Rayleigh-fading broadcast channel with no channel state information available to the receiver (CSIR), where the bound on the capacity region obtained by a naive application of the scalar upper bound is provably loose, because it fails to account for the additional loss in degrees of freedom due to lack of channel knowledge at the receiver. A tighter upper bound is obtained by separately accounting for the loss in degrees of freedom due to lack of CSIR before applying the scalar upper bound.Keywords
This publication has 17 references indexed in Scilit:
- Limited Feedback Unitary Precoding for Spatial Multiplexing SystemsIEEE Transactions on Information Theory, 2005
- Capacity of a mobile multiple-antenna wireless link with isotropically random rician fadingIEEE Transactions on Information Theory, 2003
- On the achievable throughput of a multiantenna Gaussian broadcast channelIEEE Transactions on Information Theory, 2003
- Communication on the Grassmann manifold: a geometric approach to the noncoherent multiple-antenna channelIEEE Transactions on Information Theory, 2002
- Capacity and optimal resource allocation for fading broadcast channels .I. Ergodic capacityIEEE Transactions on Information Theory, 2001
- On the capacity of some channels with channel state informationIEEE Transactions on Information Theory, 1999
- A simple transmit diversity technique for wireless communicationsIEEE Journal on Selected Areas in Communications, 1998
- A simple converse for broadcast channels with additive white Gaussian noise (Corresp.)IEEE Transactions on Information Theory, 1974
- Random coding theorem for broadcast channels with degraded componentsIEEE Transactions on Information Theory, 1973
- Broadcast channelsIEEE Transactions on Information Theory, 1972