403 research outputs found
Memoryless relay strategies for two-way relay channels
We propose relaying strategies for uncoded two-way relay channels, where two terminals transmit simultaneously to each other with the help of a relay. In particular, we consider a memoryless system, where the signal transmitted by the relay is obtained by applying an instantaneous relay function to the previously received signal. For binary antipodal signaling, a class of so called absolute (abs)-based schemes is proposed in which the processing at the relay is solely based on the absolute value of the received signal. We analyze and optimize the symbol-error performance of existing and new abs-based and non-abs-based strategies under an average power constraint, including abs-based and non-abs-based versions of amplify and forward (AF), detect and forward (DF), and estimate and forward (EF). Additionally, we optimize the relay function via functional analysis such that the average probability of error is minimized at the high signal-to-noise ratio (SNR) regime. The optimized relay function is shown to be a Lambert W function parameterized on the noise power and the transmission energy. The optimized function behaves like abs-AF at low SNR and like abs-DF at high SNR, respectively; EF behaves similarly to the optimized function over the whole SNR range. We find the conditions under which each class of strategies is preferred. Finally, we show that all these results can also be generalized to higher order constellations
Memoryless Relay Strategies for Two-Way Relay Channels: Performance Analysis and Optimization
We consider relaying strategies for two-way relay channels, where two terminals transmits simultaneously to each other with the help of relays. A memoryless system is considered, where the signal transmitted by a relay depends only on its last received signal. For binary antipodal signaling, we analyze and optimize the performance of existing amplify and forward (AF) and absolute (abs) decode and forward (ADF) for two- way AWGN relay channels. A new abs-based AF (AAF) scheme is proposed, which has better performance than AF. In low SNR, AAF performs even better than ADF. Furthermore, a novel estimate and forward (EF) strategy is proposed which performs better than ADF. More importantly, we optimize the relay strategy within the class of abs-based strategies via functional analysis, which minimizes the average probability of error over all possible relay functions. The optimized function is shown to be a Lambert's W function parameterized on the noise power and the transmission energy. The optimized function behaves like AAF in low SNR and like ADF in high SNR, resp., where EF behaves like the optimized function over the whole SNR range
Resource Allocation for Energy-Efficient 3-Way Relay Channels
Throughput and energy efficiency in 3-way relay channels are studied in this
paper. Unlike previous contributions, we consider a circular message exchange.
First, an outer bound and achievable sum rate expressions for different
relaying protocols are derived for 3-way relay channels. The sum capacity is
characterized for certain SNR regimes. Next, leveraging the derived achievable
sum rate expressions, cooperative and competitive maximization of the energy
efficiency are considered. For the cooperative case, both low-complexity and
globally optimal algorithms for joint power allocation at the users and at the
relay are designed so as to maximize the system global energy efficiency. For
the competitive case, a game theoretic approach is taken, and it is shown that
the best response dynamics is guaranteed to converge to a Nash equilibrium. A
power consumption model for mmWave board-to-board communications is developed,
and numerical results are provided to corroborate and provide insight on the
theoretical findings.Comment: Submitted to IEEE Transactions on Wireless Communication
Broadcast Capacity Region of Two-Phase Bidirectional Relaying
In a three-node network a half-duplex relay node enables bidirectional
communication between two nodes with a spectral efficient two phase protocol.
In the first phase, two nodes transmit their message to the relay node, which
decodes the messages and broadcast a re-encoded composition in the second
phase. In this work we determine the capacity region of the broadcast phase. In
this scenario each receiving node has perfect information about the message
that is intended for the other node. The resulting set of achievable rates of
the two-phase bidirectional relaying includes the region which can be achieved
by applying XOR on the decoded messages at the relay node. We also prove the
strong converse for the maximum error probability and show that this implies
that the [\eps_1,\eps_2]-capacity region defined with respect to the average
error probability is constant for small values of error parameters \eps_1,
\eps_2.Comment: 25 pages, 2 figures, submitted to IEEE Transactions on Information
Theor
The Approximate Optimality of Simple Schedules for Half-Duplex Multi-Relay Networks
In ISIT'12 Brahma, \"{O}zg\"{u}r and Fragouli conjectured that in a
half-duplex diamond relay network (a Gaussian noise network without a direct
source-destination link and with non-interfering relays) an approximately
optimal relay scheduling (achieving the cut-set upper bound to within a
constant gap uniformly over all channel gains) exists with at most active
states (only out of the possible relay listen-transmit
configurations have a strictly positive probability). Such relay scheduling
policies are said to be simple. In ITW'13 we conjectured that simple relay
policies are optimal for any half-duplex Gaussian multi-relay network, that is,
simple schedules are not a consequence of the diamond network's sparse
topology. In this paper we formally prove the conjecture beyond Gaussian
networks. In particular, for any memoryless half-duplex -relay network with
independent noises and for which independent inputs are approximately optimal
in the cut-set upper bound, an optimal schedule exists with at most
active states. The key step of our proof is to write the minimum of a
submodular function by means of its Lov\'{a}sz extension and use the greedy
algorithm for submodular polyhedra to highlight structural properties of the
optimal solution. This, together with the saddle-point property of min-max
problems and the existence of optimal basic feasible solutions in linear
programs, proves the claim.Comment: Submitted to IEEE Information Theory Workshop (ITW) 201
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
- …