Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the Degrees-of-Freedom of the K-user Distributed Broadcast Channel

Published 27 Jan 2016 in cs.IT and math.IT | (1601.07399v6)

Abstract: We study the Degrees-of-Freedom (DoF) in a wireless setting in which K Transmitters (TXs) aim at jointly serving K users. The performance is studied when the TXs are faced with a distributed Channel State Information (CSI) configuration in which each TX has access to its own multi-user imperfect channel estimate based on which it designs its transmit coefficients. The channel estimates are not only imperfectly acquired but they are also imperfectly shared between the TXs. Our first contribution consists of computing a genie-aided upper bound for the DoF of that setting. Our main contribution is then to develop a new robust transmission scheme that leverages the different qualities of CSI available at the TXs to improve the achieved DoF. We show the surprising result that there is a CSI regime, coined the Weak-CSIT regime, in which the genie-aided upper bound is achieved by the proposed transmission scheme. Interestingly, the optimal DoF in the Weak-CSIT regime only depends on the CSI quality at the best informed TX and not on the CSI quality at all other TXs.

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.