Bounds and lattice-based transmission strategies for the phase-faded dirty-paper channel
IEEE Transactions on Wireless Communications
On downlink transmission without transmit channel state information and with outage constraints
IEEE Transactions on Information Theory
Throughput of precoded broadcast transmission with noisy feedback
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Cognitive radio with partial channel state information at the transmitter
IEEE Transactions on Wireless Communications
| Hi-index | 754.90 |
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.