2,349 research outputs found
Degrees of Freedom for the MIMO Multi-way Relay Channel
This paper investigates the degrees of freedom (DoF) of the L-cluster, K-user
MIMO multi-way relay channel, where users in each cluster wish to exchange
messages within the cluster, and they can only communicate through the relay. A
novel DoF upper bound is derived by providing users with carefully designed
genie information. Achievable DoF is identified using signal space alignment
and multiple-access transmission. For the two-cluster MIMO multi-way relay
channel with two users in each cluster, DoF is established for the general case
when users and the relay have arbitrary number of antennas, and it is shown
that the DoF upper bound can be achieved using signal space alignment or
multiple-access transmission, or a combination of both. The result is then
generalized to the three user case. For the L-cluster K-user MIMO multi-way
relay channel in the symmetric setting, conditions under which the DoF upper
bound can be achieved are established. In addition to being shown to be tight
in a variety of scenarios of interests of the multi-way relay channel, the
newly derived upperbound also establishes the optimality of several previously
established achievable DoF results for multiuser relay channels that are
special cases of the multi-way relay channel.Comment: submitted to IEEE Transactions on Information Theor
The Degrees of Freedom of the MIMO Y-channel
The degrees of freedom (DoF) of the MIMO Y-channel, a multi-way communication
network consisting of 3 users and a relay, are characterized for arbitrary
number of antennas. The converse is provided by cut-set bounds and novel
genie-aided bounds. The achievability is shown by a scheme that uses
beamforming to establish network coding on-the-fly at the relay in the uplink,
and zero-forcing pre-coding in the downlink. It is shown that the network has
min{2M_2+2M_3,M_1+M_2+M_3,2N} DoF, where M_j and N represent the number of
antennas at user j and the relay, respectively. Thus, in the extreme case where
M_1+M_2+M_3 dominates the DoF expression and is smaller than N, the network has
the same DoF as the MAC between the 3 users and the relay. In this case, a
decode and forward strategy is optimal. In the other extreme where 2N
dominates, the DoF of the network is twice that of the aforementioned MAC, and
hence network coding is necessary. As a byproduct of this work, it is shown
that channel output feedback from the relay to the users has no impact on the
DoF of this channel.Comment: 5 pages, 4 figures, ISIT 201
- …