Back to Search
Start Over
On the fading-paper achievable region of the fading MIMO broadcast channel
- Source :
- IEEE Transactions on Information Theory. Jan, 2008, Vol. 54 Issue 1, p100, 16 p.
- Publication Year :
- 2008
-
Abstract
- We consider transmission over the ergodic fading multiple-antenna broadcast (MIMO-BC) channel with partial channel state information at the transmitter and full information at the receiver. Over the equivalent non-fading channel, capacity has recently been shown to be achievable using transmission schemes that were designed for the "dirty paper" channel. We focus on a similar "fading paper" model. The evaluation of the fading paper capacity is difficult to obtain. We confine ourselves to the linear-assignment capacity, which we define, and use convex analysis methods to prove that its maximizing distribution is Gaussian. We compare our fading-paper transmission to an application of dirty paper coding that ignores the partial state information and assumes the channel is fixed at the average fade. We show that a gain is easily achieved by appropriately exploiting the information. We also consider a cooperative upper bound on the sum--rate capacity as suggested by Sato. We present a numeric example that indicates that our scheme is capable of realizing much of this upper bound. Index Terms--Broadcast channel, dirty paper, multiple-input multiple-output (MIMO), Sato bound.
Details
- Language :
- English
- ISSN :
- 00189448
- Volume :
- 54
- Issue :
- 1
- Database :
- Gale General OneFile
- Journal :
- IEEE Transactions on Information Theory
- Publication Type :
- Academic Journal
- Accession number :
- edsgcl.173748520