Papers
Topics
Authors
Recent
Search
2000 character limit reached

DoF Region of the MISO BC with Partial CSIT: Proof by Inductive Fourier-Motzkin Elimination

Published 5 Mar 2019 in cs.IT and math.IT | (1903.01767v1)

Abstract: We provide a fresh perspective on the problem of characterizing the DoF region of the $K$-user MISO BC with arbitrary levels of partial CSIT. In a previous achievability proof, Piovano and Clerckx characterized all faces describing a polyhedral outer bound region, and then with the aid of mathematical induction, prescribed a scheme based on rate-splitting with flexible assignment of common DoF and power levels to achieve each such face. We propose an alternative approach in which we deal directly with the region achievable through rate-splitting and employ a Fourier-Motzkin procedure to eliminate all auxiliary variables, hence reducing the achievable region to the known outer bound. A key insight emerging from our proof is that tuning only one power variable, as well as assigning the common DoF, is sufficient to achieve the entire DoF region, as opposed to $K$ power variables previously employed.

Authors (2)
Citations (7)

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.