On the Fading-Paper Achievable Region of the Fading MIMO Broadcast Channel

From MaRDI portal
Publication:3604716

DOI10.1109/TIT.2007.911268zbMATH Open1306.94002arXivcs/0610021OpenAlexW2122262372MaRDI QIDQ3604716FDOQ3604716


Authors: Amir Bennatan, David Burshtein Edit this on Wikidata


Publication date: 24 February 2009

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: We consider transmission over the ergodic fading multi-antenna broadcast (MIMO-BC) channel with partial channel state information at the transmitter and full information at the receiver. Over the equivalent {it 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 {it 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.


Full work available at URL: https://arxiv.org/abs/cs/0610021




Recommendations





Cited In (3)





This page was built for publication: On the Fading-Paper Achievable Region of the Fading MIMO Broadcast Channel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604716)