Papers
Topics
Authors
Recent
Search
2000 character limit reached

Achievable Degrees of Freedom on K-user MIMO Multi-way Relay Channel with Common and Private Messages

Published 1 Oct 2015 in cs.IT and math.IT | (1510.00359v3)

Abstract: This paper investigates the achievable total degrees of freedom (DoF) of the MIMO multi-way relay channel that consists of K users, where each user is equipped with M antennas, and a decode-and-forward relay equipped with N antennas. In this channel, each user wants to convey K-1 private messages to the other users in addition to a common message to all of them. Due to the absence of direct links between the users, communication occurs through the relay in two phases; a multiple access channel phase (MAC) and a broadcast (BC) phase. We drive cut-set bounds on the total DoF of the network, and show that the network has DoF less than or equal to K min(N,M). Achievability of the upper bound is shown by using signal space alignment for network coding in the MAC phase, and zero-forcing precoding in the BC phase. We show that introducing the common messages besides the private messages leads to achieving higher total DoF than using the private messages only.

Citations (6)

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.