30 research outputs found
On the Achievable Rates of Multihop Virtual Full-Duplex Relay Channels
We study a multihop "virtual" full-duplex relay channel as a special case of
a general multiple multicast relay network. For such channel,
quantize-map-and-forward (QMF) (or noisy network coding (NNC)) achieves the
cut-set upper bound within a constant gap where the gap grows {\em linearly}
with the number of relay stages . However, this gap may not be negligible
for the systems with multihop transmissions (i.e., a wireless backhaul
operating at higher frequencies). We have recently attained an improved result
to the capacity scaling where the gap grows {\em logarithmically} as ,
by using an optimal quantization at relays and by exploiting relays' messages
(decoded in the previous time slot) as side-information. In this paper, we
further improve the performance of this network by presenting a mixed scheme
where each relay can perform either decode-and-forward (DF) or QMF with
possibly rate-splitting. We derive the achievable rate and show that the
proposed scheme outperforms the QMF-optimized scheme. Furthermore, we
demonstrate that this performance improvement increases with .Comment: To be presented at ISIT 201
Energy harvesting non-orthogonal multiple access system with multi-antenna relay and base station
In this paper, we consider downlink non-orthogonal multiple access cooperative communication system. The base station (BS) serves two types of users, which are named relay user (RU) and far user (FU). The BS and RU are equipped with multiple transmit antennas. The RU harvests energy from the BS transmissions to perform the relaying operation for the FU. We have considered 1) amplify-forward; 2) decode-forward; and 3) quantize-map-forward relaying protocols at the RU. As the BS and RU have multiple antennas, therefore we consider 1) beamforming and 2) random antenna selection strategies at the BS and RU. Closed form expressions for the outage probability are provided for the aforementioned relay protocols and antenna strategies. Further, we show that for certain data rate range of the relay and FU the quantize-map-forward relaying protocol can perform better than the other two relaying protocols
Wireless Network Information Flow: A Deterministic Approach
In a wireless network with a single source and a single destination and an
arbitrary number of relay nodes, what is the maximum rate of information flow
achievable? We make progress on this long standing problem through a two-step
approach. First we propose a deterministic channel model which captures the key
wireless properties of signal strength, broadcast and superposition. We obtain
an exact characterization of the capacity of a network with nodes connected by
such deterministic channels. This result is a natural generalization of the
celebrated max-flow min-cut theorem for wired networks. Second, we use the
insights obtained from the deterministic analysis to design a new
quantize-map-and-forward scheme for Gaussian networks. In this scheme, each
relay quantizes the received signal at the noise level and maps it to a random
Gaussian codeword for forwarding, and the final destination decodes the
source's message based on the received signal. We show that, in contrast to
existing schemes, this scheme can achieve the cut-set upper bound to within a
gap which is independent of the channel parameters. In the case of the relay
channel with a single relay as well as the two-relay Gaussian diamond network,
the gap is 1 bit/s/Hz. Moreover, the scheme is universal in the sense that the
relays need no knowledge of the values of the channel parameters to
(approximately) achieve the rate supportable by the network. We also present
extensions of the results to multicast networks, half-duplex networks and
ergodic networks.Comment: To appear in IEEE transactions on Information Theory, Vol 57, No 4,
April 201
A Tutorial on Nonorthogonal Multiple Access for 5G and Beyond
Today's wireless networks allocate radio resources to users based on the
orthogonal multiple access (OMA) principle. However, as the number of users
increases, OMA based approaches may not meet the stringent emerging
requirements including very high spectral efficiency, very low latency, and
massive device connectivity. Nonorthogonal multiple access (NOMA) principle
emerges as a solution to improve the spectral efficiency while allowing some
degree of multiple access interference at receivers. In this tutorial style
paper, we target providing a unified model for NOMA, including uplink and
downlink transmissions, along with the extensions tomultiple inputmultiple
output and cooperative communication scenarios. Through numerical examples, we
compare the performances of OMA and NOMA networks. Implementation aspects and
open issues are also detailed.Comment: 25 pages, 10 figure
Capacity Bounds for a Class of Interference Relay Channels
The capacity of a class of Interference Relay Channels (IRC) -the Injective
Semideterministic IRC where the relay can only observe one of the sources- is
investigated. We first derive a novel outer bound and two inner bounds which
are based on a careful use of each of the available cooperative strategies
together with the adequate interference decoding technique. The outer bound
extends Telatar and Tse's work while the inner bounds contain several known
results in the literature as special cases. Our main result is the
characterization of the capacity region of the Gaussian class of IRCs studied
within a fixed number of bits per dimension -constant gap. The proof relies on
the use of the different cooperative strategies in specific SNR regimes due to
the complexity of the schemes. As a matter of fact, this issue reveals the
complex nature of the Gaussian IRC where the combination of a single coding
scheme for the Gaussian relay and interference channel may not lead to a good
coding scheme for this problem, even when the focus is only on capacity to
within a constant gap over all possible fading statistics.Comment: 23 pages, 6 figures. Submitted to IEEE Transactions on Information
Theory (revised version