Papers
Topics
Authors
Recent
Search
2000 character limit reached

DoF Analysis of the MIMO Broadcast Channel with Alternating/Hybrid CSIT

Published 27 Jan 2016 in cs.IT and math.IT | (1601.07325v1)

Abstract: We consider a $K$-user multiple-input single-output (MISO) broadcast channel (BC) where the channel state information (CSI) of user $i(i=1,2,\ldots,K)$ may be instantaneously perfect (P), delayed (D) or not known (N) at the transmitter with probabilities $\lambda_Pi$, $\lambda_Di$ and $\lambda_Ni$, respectively. In this setting, according to the three possible CSIT for each user, knowledge of the joint CSIT of the $K$ users could have at most $3K$ states. In this paper, given the marginal probabilities of CSIT (i.e., $\lambda_Pi$, $\lambda_Di$ and $\lambda_Ni$), we derive an outer bound for the DoF region of the $K$-user MISO BC. Subsequently, we tighten this outer bound by taking into account a set of inequalities that capture some of the $3K$ states of the joint CSIT. One of the consequences of this set of inequalities is that for $K\geq3$, it is shown that the DoF region is not completely characterized by the marginal probabilities in contrast to the two-user case. Afterwards, the tightness of these bounds are investigated through the discussion on the achievability. Finally, a two user MIMO BC having CSIT among P and N is considered in which an outer bound for the DoF region is provided and it is shown that in some scenarios it is tight.

Citations (14)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.