Transmitter cooperation in interference channel with delayed CSIT

Lashgari, Sina; Avestimehr, A. Salman

doi:10.1109/allerton.2014.7028480

Cited by 3 publications

(2 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…APPENDIX E PROOF OF LEAST ALIGNMENT LEMMA (PROOF OF LEMMAS 3,7) Note that Lemma 3 is a special case of Lemma 7 where k = 3 and j = 3. Therefore, in order to prove Lemma 3 and Lemma 7 it is sufficient to prove only Lemma 7.…”

Section: B Proof Of Lemmamentioning

confidence: 99%

“…They studied the problem of k-user multiple-input single-output broadcast channel (MISO BC) with delayed CSIT, and showed that for such network DoF = k 1+ 1 2 +...+ 1 k . This work was followed by several other works which studied other network configurations under the assumption of delayed CSIT, including interference channel [4]- [7], X-channel [8], [9], multi-hop networks [10], and other variations of delayed CSIT [11].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

MISO Broadcast Channel With Hybrid CSIT: Beyond Two Users

Lashgari

Tandon

Avestimehr

2016

IEEE Trans. Inform. Theory

Self Cite

View full text Add to dashboard Cite

We study the impact of heterogeneity of channel-state-information available at the transmitters (CSIT) on the capacity of broadcast channels with a multiple-antenna transmitter and k single-antenna receivers (MISO BC). In particular, we consider the k-user MISO BC, where the CSIT with respect to each receiver can be either instantaneous/perfect, delayed, or not available; and we study the impact of this heterogeneity of CSIT on the degreesof-freedom (DoF) of such network. We first focus on the 3-user MISO BC; and we completely characterize the DoF region for all possible heterogeneous CSIT configurations, assuming linear encoding strategies at the transmitters. The result shows that the state-of-the-art achievable schemes in the literature are indeed sum-DoF optimal, when restricted to linear encoding schemes. To prove the result, we develop a novel bound, called Interference Decomposition Bound, which provides a lower bound on the interference dimension at a receiver which supplies delayed CSIT based on the average dimension of constituents of that interference, thereby decomposing the interference into its individual components. Furthermore, we extend our outer bound on the DoF region to the general k-user MISO BC, and demonstrate that it leads to an approximate characterization of linear sum-DoF to within an additive gap of 0.5 for a broad range of CSIT configurations. Moreover, for the special case where only one receiver supplies delayed CSIT, we completely characterize the linear sum-DoF.This work has been presented in part in [1], [2].

show abstract

Section: B Proof Of Lemmamentioning

confidence: 99%