71,028 research outputs found
The Multi-way Relay Channel
The multiuser communication channel, in which multiple users exchange
information with the help of a relay terminal, termed the multi-way relay
channel (mRC), is introduced. In this model, multiple interfering clusters of
users communicate simultaneously, where the users within the same cluster wish
to exchange messages among themselves. It is assumed that the users cannot
receive each other's signals directly, and hence the relay terminal in this
model is the enabler of communication. In particular, restricted encoders,
which ignore the received channel output and use only the corresponding
messages for generating the channel input, are considered. Achievable rate
regions and an outer bound are characterized for the Gaussian mRC, and their
comparison is presented in terms of exchange rates in a symmetric Gaussian
network scenario. It is shown that the compress-and-forward (CF) protocol
achieves exchange rates within a constant bit offset of the exchange capacity
independent of the power constraints of the terminals in the network. A finite
bit gap between the exchange rates achieved by the CF and the
amplify-and-forward (AF) protocols is also shown. The two special cases of the
mRC, the full data exchange model, in which every user wants to receive
messages of all other users, and the pairwise data exchange model which
consists of multiple two-way relay channels, are investigated in detail. In
particular for the pairwise data exchange model, in addition to the proposed
random coding based achievable schemes, a nested lattice coding based scheme is
also presented and is shown to achieve exchange rates within a constant bit gap
of the exchange capacity.Comment: Revised version of our submission to the Transactions on Information
Theor
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
Weak Secrecy in the Multi-Way Untrusted Relay Channel with Compute-and-Forward
We investigate the problem of secure communications in a Gaussian multi-way
relay channel applying the compute-and-forward scheme using nested lattice
codes. All nodes employ half-duplex operation and can exchange confidential
messages only via an untrusted relay. The relay is assumed to be honest but
curious, i.e., an eavesdropper that conforms to the system rules and applies
the intended relaying scheme. We start with the general case of the
single-input multiple-output (SIMO) L-user multi-way relay channel and provide
an achievable secrecy rate region under a weak secrecy criterion. We show that
the securely achievable sum rate is equivalent to the difference between the
computation rate and the multiple access channel (MAC) capacity. Particularly,
we show that all nodes must encode their messages such that the common
computation rate tuple falls outside the MAC capacity region of the relay. We
provide results for the single-input single-output (SISO) and the
multiple-input single-input (MISO) L-user multi-way relay channel as well as
the two-way relay channel. We discuss these results and show the dependency
between channel realization and achievable secrecy rate. We further compare our
result to available results in the literature for different schemes and show
that the proposed scheme operates close to the compute-and-forward rate without
secrecy.Comment: submitted to JSAC Special Issue on Fundamental Approaches to Network
Coding in Wireless Communication System
Capacity Theorems for the AWGN Multi-Way Relay Channel
The L-user additive white Gaussian noise multi-way relay channel is
considered, where multiple users exchange information through a single relay at
a common rate. Existing coding strategies, i.e., complete-decode-forward and
compress-forward are shown to be bounded away from the cut-set upper bound at
high signal-to-noise ratios (SNR). It is known that the gap between the
compress-forward rate and the capacity upper bound is a constant at high SNR,
and that between the complete-decode-forward rate and the upper bound increases
with SNR at high SNR. In this paper, a functional-decode-forward coding
strategy is proposed. It is shown that for L >= 3, complete-decode-forward
achieves the capacity when SNR <= 0 dB, and functional-decode-forward achieves
the capacity when SNR >= 0 dB. For L=$, functional-decode-forward achieves the
capacity asymptotically as SNR increases.Comment: accepted and to be presented at ISIT 201
Optimal Coding Functions for Pairwise Message Sharing on Finite-Field Multi-Way Relay Channels
This paper considers the finite-field multi-way relay channel with pairwise
message sharing, where multiple users exchange messages through a single relay
and where the users may share parts of their source messages (meaning that some
message parts are known/common to more than one user). In this paper, we design
an optimal functional-decode-forward coding scheme that takes the shared
messages into account. More specifically, we design an optimal function for the
relay to decode (from the users on the uplink) and forward (back to the users
on the downlink). We then show that this proposed function-decode-forward
coding scheme can achieve the capacity region of the finite-field multi-way
relay channel with pairwise message sharing. This paper generalizes our
previous result for the case of three users to any number of users.Comment: Author's final version (accepted for presentation at the 2014 IEEE
International Conference on Communications [ICC 2014]
The Capacity Region of Restricted Multi-Way Relay Channels with Deterministic Uplinks
This paper considers the multi-way relay channel (MWRC) where multiple users
exchange messages via a single relay. The capacity region is derived for a
special class of MWRCs where (i) the uplink and the downlink are separated in
the sense that there is no direct user-to-user links, (ii) the channel is
restricted in the sense that each user's transmitted channel symbols can depend
on only its own message, but not on its received channel symbols, and (iii) the
uplink is any deterministic function.Comment: Author's final version (to be presented at ISIT 2012
The Finite Field Multi-Way Relay Channel with Correlated Sources: The Three-User Case
The three-user finite field multi-way relay channel with correlated sources
is considered. The three users generate possibly correlated messages, and each
user is to transmit its message to the two other users reliably in the Shannon
sense. As there is no direct link among the users, communication is carried out
via a relay, and the link from the users to the relay and those from the relay
to the users are finite field adder channels with additive noise of arbitrary
distribution. The problem is to determine the set of all possible achievable
rates, defined as channel uses per source symbol for reliable communication.
For two classes of source/channel combinations, the solution is obtained using
Slepian-Wolf source coding combined with functional-decode-forward channel
coding.Comment: to be presented at ISIT 201
- …