In this paper, we propose to implement the dynamic decode-and-forward (DDF) protocol with distributed rotations. In addition to being the first minimum-delay implementation of the DDF protocol proposed for any number of relays, this technique allows to exploit cooperative diversity without inducing the high decoding complexity of a space-time code. The analysis of outage probabilities for different number of relays and rotations shows that the performance of this technique is close to optimal. Moreover, a lower-bound on the diversity-multiplexing gain tradeoff (DMT) is provided in the case of a single relay and two rotations. This lower-bound reaches the optimal DDF's DMT when the frame-length grows to infinity, which shows that even a small number of rotations is enough to obtain good performance.
In this paper, a superposition-coded concurrent decode-and-forward (DF) relaying protocol is presented. A specific scenario, where the inter-relay channel is sufficiently strong, is considered. Assuming perfect source-relay transmissions, the proposed scheme further improves the diversity performance of previously proposed repetition-coded concurrent DF relaying, in which the advantage of the inter-relay interference is not fully extracted.
We study the outage probability of opportunistic relay selection in decode-and-forward relaying with secrecy constraints. We derive the closed-form expression for the outage probability. Based on the analytical result, the asymptotic performance is then investigated. The accuracy of our performance analysis is verified by the simulation results.
In this paper, we adopt the relay selection (RS) protocol proposed by Bletsas, Khisti, Reed and Lippman (2006) with Enhanced Dynamic Decode-and-Forward (EDDF) and network coding (NC) system in a two-hop two-way multi-relay network. All nodes are single-input single-output (SISO) and half-duplex, i.e., they cannot transmit and receive data simultaneously. The outage probability is analyzed and we show comparisons of outage probability with various scenarios under Rayleigh fading channel. Our results show that the relay selection with EDDF and network coding (RS-EDDF&NC) scheme has the best perf…
We derive the capacity of the binary multi-way relay channel, in which multiple users exchange messages at a common rate through a relay. The capacity is achieved using a novel functional-decode-forward coding strategy. In the functional-decode-forward coding strategy, the relay decodes functions of the users' messages without needing to decode individual messages. The functions to be decoded by the relay are defined such that when the relay broadcasts the functions back to the users, every user is able to decode the messages of all other users.
We consider the full-duplex two-way relay channel with direct link between two users and propose two coding schemes: a partial decode-forward scheme, and a combined decode-forward and compute-forward scheme. Both schemes use rate-splitting and superposition coding at each user and generate codewords for each node independently. When applied to the Gaussian channel, partial decode-forward can strictly increase the rate region over decode-forward, which is opposite to the one-way relay channel. The combined scheme uses superposition coding of both Gaussian and lattice codes to allow the relay to…
We consider the general discrete memoryless two-way relay channel, where two users exchange messages via a relay, and propose two functional-decode-forward coding strategies for this channel. Functional-decode-forward involves the relay decoding a function of the users' messages rather than the individual messages themselves. This function is then broadcast back to the users, which can be used in conjunction with the user's own message to decode the other user's message. Via a numerical example, we show that functional-decode-forward with linear codes is capable of achieving strictly larger su…
The diversity-multiplexing tradeoff of the dynamic decode-and-forward protocol is characterized for the half-duplex three-terminal (m,k,n)-relay channel where the source, relay and the destination terminals have m, k and n antennas, respectively. It is obtained as a solution to a simple, two-variable, convex optimization problem and this problem is solved in closed form for special classes of relay channels, namely, the (1,k,1) relay channel, the (n,1,n) relay channel and the (2,k,2) relay channel. Moreover, the tradeoff curves for a certain class of relay channels, such as the (m,k,n>k) chann…
The multicast capacity of the Gaussian two-hop relay network with one source, $N$ relays, and $L$ destinations is studied. It is shown that a careful modification of the partial decode--forward coding scheme, whereby the relays cooperate through degraded sets of message parts, achieves the cutset upper bound within $(1/2)\log N$ bits regardless of the channel gains and power constraints. This scheme improves upon a previous scheme by Chern and Ozgur, which is also based on partial decode--forward yet has an unbounded gap from the cutset bound for $L \ge 2$ destinations. When specialized to ind…
We study a discrete-memoryless relay network consisting of one source, one destination and N relays, and design a scheme based on partial decode-forward relaying. The source splits its message into one common and N+1 private parts, one intended for each relay. It encodes these message parts using Nth-order block Markov coding, in which each private message part is independently superimposed on the common parts of the current and N previous blocks. Using simultaneous sliding window decoding, each relay fully recovers the common message and its intended private message with the same block index,…
In this paper, we examine the performance of the decode-and-forward (DF) relaying protocols with finite blocklength (FB). We provide the overall outage probability of three distinct DF relaying protocols, where the channels are assumed to be quasi static Rayleigh fading. More importantly, we derive the closed form expressions of the outage probability in the three relaying scenarios. We illustrate protocols where the cooperative communications outperform the direct transmission (DT). In addition, we compare the operating efficiency of the cooperative schemes in the ultra-reliable (UR) region.
In this paper, for a fading decode-and-forward full-duplex relay channel, we analytically derive optimum power allocations. Individual power constraints for the source and the relay are assumed and the related optimization problem is analyzed for two scenarios. First, optimization is taken over the source power, the relay power, and the correlation coefficient between the transmitted signals of the source and the relay. Then, for a fixed value of correlation coefficient, the optimization problem is analyzed. It is also proven that the optimization problems are convex for these two scenarios. F…
This paper proposes a relaying strategy for the multiple-relay network in which each relay decodes a selection of transmitted messages by other transmitting terminals, and forwards parities of the decoded codewords. This protocol improves the previously known achievable rate of the decode-and-forward (DF) strategy for multirelay networks by allowing relays to decode only a selection of messages from relays with strong links to it. Hence, each relay may have several choices as to which messages to decode, and for a given network many different parity forwarding protocols may exist. A tree struc…
This paper compares the partial-decode-forward and the complete-decode-forward coding strategies for the half-duplex Gaussian single-relay channel. We analytically show that the rate achievable by partial-decode-forward outperforms that of the more straightforward complete-decode-forward by at most 12.5%. Furthermore, in the following asymptotic cases, the gap between the partial-decode-forward and the complete-decode-forward rates diminishes: (i) when the relay is close to the source, (ii) when the relay is close to the destination, and (iii) when the SNR is low. In addition, when the SNR inc…
This paper presents a relay selection for decode-and-forward based on network coding (DF-NC) and analog-NC protocols in general scheme of cellular network system. In the propose scheme the two source node simultaneously transmit their own information to all the relays as well as the destination node, and then, a single relay i.e. best with a minimum symbol error rate (SER) will be selected to forward the new version of the received signal. Simulation results show that, the DF-NC scheme with considerable performance has exactness over analog-NC scheme. To improve the system performance, optimal…
We propose composite decode-forward (DF) schemes for the two-way relay channel in both the full- and half-duplex modes by combining coherent relaying, independent relaying and partial relaying strategies. For the full-duplex mode, the relay partially decodes each user's information in each block and forwards this partial information coherently with the source user to the destination user in the next block as in block Markov coding. In addition, the relay independently broadcasts a binning index of both users' decoded information parts in the next block as in independent network coding. Each te…
The exact closed-form expressions for outage probability and bit error rate of spectrum sharing-based multi-hop decodeand- forward (DF) relay networks in non-identical Rayleigh fading channels are derived. We also provide the approximate closed-form expression for the system ergodic capacity. Utilizing these tractable analytical formulas, we can study the impact of key network parameters on the performance of cognitivemulti-hop relay networks under interference constraints. Using a linear network model, we derive an optimum relay position scheme by numerically solving an optimization problem o…
We consider spatially-coupled protograph-based LDPC codes for the three terminal erasure relay channel. It is observed that BP threshold value, the maximal erasure probability of the channel for which decoding error probability converges to zero, of spatially-coupled codes, in particular spatially-coupled MacKay-Neal code, is close to the theoretical limit for the relay channel. Empirical results suggest that spatially-coupled protograph-based LDPC codes have great potential to achieve theoretical limit of a general relay channel.
The dynamic decode-and-forward (DDF) relaying protocol is a relatively new cooperative scheme which has been shown to achieve promising theoretical results in terms of diversity-multiplexing gain tradeoff and error rates. The case of a single relay has been extensively studied in the literature and several techniques to approach the optimum performance have been proposed. Until recently, however, a practical implementation for the case of several relays had been considered to be much more challenging. A rotation-based DDF technique, suitable for any number of relays, has been recently proposed…
A new coding scheme for general N-node relay networks is presented for unicast, multicast, and broadcast. The proposed distributed decode-forward scheme combines and generalizes Marton coding for single-hop broadcast channels and the Cover-El Gamal partial decode-forward coding scheme for 3-node relay channels. The key idea of the scheme is to precode all the codewords of the entire network at the source by multicoding over multiple blocks. This encoding step allows these codewords to carry partial information of the messages implicitly without complicated rate splitting and routing. This part…
This paper considers the problem of selecting a subset of nodes in a two-hop wireless network to act as relays in aiding the communication between the source-destination pair. Optimal relay subset selection with the objective of maximizing the overall throughput is a difficult problem that depends on multiple factors including node locations, queue lengths and power consumption. A partial decode-and-forward strategy is applied in this paper to improve the tractability of the relay selection problem and performance of the overall network. Note that the number of relays selected ultimately deter…
We propose two coding schemes combining decode-forward (DF) and noisy network coding (NNC) with different flavors. The first is a combined DF-NNC scheme for the one-way relay channel which includes both DF and NNC as special cases by performing rate splitting, partial block Markov encoding and NNC. The second combines two different DF strategies and layered NNC for the two-way relay channel. One DF strategy performs coherent block Markov encoding at the source at the cost of power splitting at the relay, the other performs independent source and relay encoding but with full relay power, and la…
In this paper, we analyze a composite decode-and-forward scheme for the two-way relay channel with a direct link. During transmission, our scheme combines both block Markov coding and an independent coding scheme similar to network coding at the relay. The main contribution of this work is to examine how link state impacts the allocation of power between these two distinct techniques, which in turn governs the necessity of each technique in achieving the largest transmission rate region. We analytically determine the link-state regimes and associated relaying techniques. Our results illustrate…
In this work, a relay channel is studied in which a source encoder communicates with a destination decoder through a number of out-of-band relays that are connected to the decoder through capacity-constrained digital backhaul links. This model is motivated by the uplink of cloud radio access networks. In this scenario, a novel transmission and relaying strategies are proposed in which multi-layer transmission is used, on the one hand, to adaptively leverage the different decoding capabilities of the relays and, on the other hand, to enable hybrid decode-and-forward (DF) and compress-and-forwar…
Decode-and-forward (DF) cooperative communication based on free space optical (FSO) links is studied in this letter. We analyze performance of the DF protocol in the FSO links following the Gamma-Gamma distribution. The cumulative distribution function (CDF) and probability density function (PDF) of a random variable containing mixture of the Gamma- Gamma and Gaussian random variables is derived. By using the derived CDF and PDF, average bit error rate of the DF relaying is obtained.
In their landmark paper Cover and El Gamal proposed different coding strategies for the relay channel with a single relay supporting a communication pair. These strategies are the decode-and-forward and compress-and-forward approach, as well as a general lower bound on the capacity of a relay network which relies on the mixed application of the previous two strategies. So far, only parts of their work - the decode-and-forward and the compress-and-forward strategy - have been applied to networks with multiple relays. This paper derives a mixed strategy for multiple relay networks using a combin…
We analyze coding for energy efficiency in relay channels at a fixed source rate. We first propose a half-duplex decode-forward coding scheme for the Gaussian relay channel. We then derive three optimal sets of power allocation, which respectively minimize the network, the relay and the source energy consumption. These optimal power allocations are given in closed-form, which have so far remained implicit for maximum-rate schemes. Moreover, analysis shows that minimizing the network energy consumption at a given rate is not equivalent to maximizing the rate given energy, since it only covers p…
In this paper, we consider relay-assisted simultaneous wireless information and power transfer (SWIPT) for two-hop cooperative transmission, where a half-duplex multi-antenna relay adopts decode-and-forward (DF) relaying strategy for information forwarding. The relay is assumed to be energy-free and needs to harvest energy from the source node. By embedding power splitting (PS) at each relay antenna to coordinate the received energy and information, joint problem of determining PS ratios and power allocation at the multi-antenna relay node is formulated to maximize the end-to-end achievable ra…
We consider mesh networks composed of groups of relaying nodes which operate in decode-and-forward mode, where each node from a group relays information to all the nodes in the next group. We study these networks in two setups, one where the nodes have complete channel state information from the nodes that transmit to them, and another when they only have the statistics of the channel. We derive recursive expressions for the probabilities of errors of the nodes and present several implementations of detectors used in these networks. We compare the mesh networks with multihop networks, the latt…
This is the second in a two part series of papers on incorporation of the broadcast approach into oblivious protocols for the relay channel where the source and the relay are collocated. Part I described the broadcast approach and its benefits in terms of achievable rates when used with the sequential decode- and-forward (SDF) scheme. Part II investigates yet another oblivious scheme, the Block-Markov decode- and-forward (BMDF) under the single and two-layered transmissions. For the single layer, previously reported results are enhanced and a conjecture regarding the optimal correlation coeffi…
A new communication scheme for Gaussian parallel relay networks based on superposition coding and partial decoding at the relays is presented. Some specific examples are proposed in which two codebook layers are superimposed. The first level codebook is constructed with symbols from a binary or ternary alphabet while the second level codebook is composed of codewords chosen with Gaussian symbols. The new communication scheme is a generalization of decode-and-forward, amplify-and-forward, and bursty-amplify-and-forward. The asymptotic low SNR regime is studied using achievable rates and minimum…
We consider the primitive relay channel, where the source sends a message to the relay and to the destination, and the relay helps the communication by transmitting an additional message to the destination via a separate channel. Two well-known coding techniques have been introduced for this setting: decode-and-forward and compress-and-forward. In decode-and-forward, the relay completely decodes the message and sends some information to the destination; in compress-and-forward, the relay does not decode, and it sends a compressed version of the received signal to the destination using Wyner-Zi…
In this paper, we propose an opportunistic buffered decode-wait-and-forward (OBDWF) protocol to exploit both relay buffering and relay mobility to enhance the system throughput and the end-to-end packet delay under bursty arrivals. We consider a point-to-point communication link assisted by K mobile relays. We illustrate that the OBDWF protocol could achieve a better throughput and delay performance compared with existing baseline systems such as the conventional dynamic decode-and-forward (DDF) and amplified-and-forward (AF) protocol. In addition to simulation performance, we also derived clo…
In this paper, we analyze the outage performance of different multicarrier relay selection schemes for two-hop orthogonal frequency-division multiplexing (OFDM) systems in a Poisson field of relays. In particular, special emphasis is placed on decode-and-forward (DF) relay systems, equipped with bulk and per-subcarrier selection schemes, respectively. The exact expressions for outage probability are derived in integrals for general cases. In addition, asymptotic expressions for outage probability in the high signal-to-noise ratio (SNR) region in the finite circle relay distribution region are …
This paper investigates the system achievable rate and optimization for the multiple-input multiple-output (MIMO)-orthogonal frequency division multiplexing (OFDM) system with an energy harvesting (EH) relay. Firstly we propose a time switchingbased relaying (TSR) protocol to enable the simultaneous information processing and energy harvesting at the relay. Then, we discuss its achievable rate performance theoretically and formulated an optimization problem to maximize the system achievable rate. As the problem is difficult to solve, we design an Augmented Lagrangian Penalty Function (ALPF) me…
In this paper, we re-examine the relay channel under the decode-forward (DF) strategy. Contrary to the established belief that block Markov coding is always the rate-optimal DF strategy, under certain channel conditions (a link regime), independent signaling between the source and relay achieves the same transmission rate without requiring coherent channel phase information. Further, this independent signaling regime allows the relay to conserve power. As such, we design a composite DF relaying strategy that achieves the same rate as block Markov DF but with less required relay power. The find…
This paper studies the throughput maximization problem for a three-node relay channel with non-ideal circuit power. In particular, the relay operates in a half-duplex manner, and the decode-and-forward (DF) relaying scheme is adopted. Considering the extra power consumption by the circuits, the optimal power allocation to maximize the throughput of the considered system over an infinite time horizon is investigated. First, two special scenarios, i.e., the direct link transmission (only use the direct link to transmit) and the relay assisted transmission (the source and the relay transmit with …
In this paper, we study beamforming in decode-and-forward (DF) relaying using multiple relays, where the source node sends a secret message as well as a non-secret message to the destination node in the presence of multiple non-colluding eavesdroppers. The non-secret message is transmitted at a fixed rate $R_{0}$ and requires no protection from the eavesdroppers, whereas the secret message needs to be protected from the eavesdroppers. The source and relays operate under a total power constraint. We find the optimum source powers and weights of the relays for both secret and non-secret messages…
This paper proposes a relay selection scheme that aims to improve the end-to-end symbol error rate (SER) performance of a two-way relay network (TWRN). The TWRN consists of two single-antenna sources and multiple relays employing decode-and-forward (DF) protocol. It is shown that the SER performance is determined by the minimum decision distance (DD) observed in the TWRN. However, the minimum DD is likely to be made arbitrarily small by channel fading. To tackle this problem, a phase rotation (PR) aided relay selection (RS) scheme is proposed to enlarge the minium DD, which in turn improves th…
This paper considers the partial decode-and-forward (PDF) strategy for the Gaussian multiple-input multiple-output (MIMO) relay channel. Unlike for the decode-and-forward (DF) strategy or point-to-point (P2P) transmission, for which Gaussian channel inputs are known to be optimal, the input distribution that maximizes the achievable PDF rate for the Gaussian MIMO relay channel has remained unknown so far. For some special cases, e.g., for relay channels where the optimal PDF strategy reduces to DF or P2P transmission, it could be deduced that Gaussian inputs maximize the PDF rate. For the gene…
Two-way relaying can considerably improve spectral efficiency in relay-assisted bidirectional communications. However, the benefits and flexible structure of orthogonal frequency division multiplexing (OFDM)-based two-way decode-and-forward (DF) relay systems is much less exploited. Moreover, most of existing works have not considered quality-of-service (QoS) provisioning for two-way relaying. In this paper, we consider the OFDM-based bidirectional transmission where a pair of users exchange information with or without the assistance of a single DF relay. Each user can communicate with the oth…
We present the optimal relay-subset selection and transmission-time for a decode-and-forward, half-duplex cooperative network of arbitrary size. The resource allocation is obtained by maximizing over the rates obtained for each possible subset of active relays, and the unique time allocation for each set can be obtained by solving a linear system of equations. We also present a simple recursive algorithm for the optimization problem which reduces the computational load of finding the required matrix inverses, and reduces the number of required iterations. Our results, in terms of outage rate, …
Robust transceiver design against unresolvable system uncertainties is of crucial importance for reliable communication. For instance, full-duplex communication suffers from such uncertainties when canceling the self-interference, since the residual self-interference (RSI) remains uncanceled due to imperfect channel knowledge. We consider a MIMO multi-hop system, where the source, the relay and the destination are equipped with multiple antennas. We allow multi-stream beamforming granted by MIMO technique, without restricting the transmissions to single streaming. The relay can operate in eith…
In this paper, we study the three-node Decode-and-Forward (D&F) relay network subject to random and burst packet erasures. The source wishes to transmit an infinite stream of packets to the destination via the relay. The three-node D&F relay network is constrained by a decoding delay of T packets, i.e., the packet transmitted by the source at time i must be decoded by the destination by time i+T. For the individual channels from source to relay and relay to destination, we assume a delay-constrained sliding-window (DCSW) based packet-erasure model that can be viewed as a tractable approximatio…
This paper presents a novel two-way decode-and-forward (DF) relay strategy for Orthogonal Frequency Division Multiplexing (OFDM) relay networks. This DF relay strategy employs multi-subcarrier joint channel coding to leverage frequency selective fading, and thus can achieve a higher data rate than the conventional per-subcarrier DF relay strategies. We further propose a low-complexity, optimal power allocation strategy to maximize the data rate of the proposed relay strategy. Simulation results suggest that our strategy obtains a substantial gain over the per-subcarrier DF relay strategies, an…
In this paper, link selection for half-duplex buffer-aided relay systems is revisited. A new fixed scheduling policy referred as alternate distributed beamforming (ADB) is proposed, in which the relays are divided into two groups, with one group receiving the same information broadcast from the source and the other group transmitting the common messages to the destination via distributed beamforming in each time slot. It is worth noting that the relays used for reception and transmission are determined without the need of instantaneous channel state information (CSI). Theoretical analysis of t…
We consider a cooperative wireless network comprised of a source, a destination and multiple relays operating in the presence of an eavesdropper, which attempts to tap the source-destination transmission. We propose multi-relay selection scheme for protecting the source against eavesdropping. More specifically, multi-relay selection allows multiple relays to simultaneously forward the source's transmission to the destination, differing from the conventional single-relay selection where only the best relay is chosen to assist the transmission from the source to destination. For the purpose of c…
We consider a three-node decode-and-forward (DF) half-duplex relaying system, where the source first harvests RF energy from the relay, and then uses this energy to transmit information to the destination via the relay. We assume that the information transfer and wireless power transfer phases alternate over time in the same frequency band, and their {\it time fraction} (TF) may change or be fixed from one transmission epoch (fading state) to the next. For this system, we maximize the achievable average data rate. Thereby, we propose two schemes: (1) jointly optimal power and TF allocation, an…
This paper considers an amplify-and-forward relay network with fading states. Amplify-and-forward scheme (along with its variations) is the core mechanism for enabling cooperative communication in wireless networks, and hence understanding the network stability region under amplify-and-forward scheme is very important. However, in a relay network employing amplify-and-forward, the interaction between nodes is described in terms of real-valued ``packets'' (signals) instead of discrete packets (bits). This restrains the relay nodes from re-encoding the packets at desired rates. Hence, the stabil…
We consider the role of Wyner-Ziv binning in compress-forward for relay channels. In the one-way relay channel, we analyze a compress-forward scheme without Wyner- Ziv binning but with joint decoding of both the message and compression index. It achieves the same rate as the original compress-forward scheme with binning and successive decoding. Therefore, binning helps reduce decoding complexity by allowing successive decoding, but has no impact on achievable rate for the one-way relay channel. On the other hand, no binning simplifies relay operation. By extending compress-forward without binn…
This paper describes an efficient implementation of binning for the relay channel using low-density parity-check (LDPC) codes. We devise bilayer LDPC codes to approach the theoretically promised rate of the decode-and-forward relaying strategy by incorporating relay-generated information bits in specially designed bilayer graphical code structures. While conventional LDPC codes are sensitively tuned to operate efficiently at a certain channel parameter, the proposed bilayer LDPC codes are capable of working at two different channel parameters and two different rates: that at the relay and at t…
The key advantage of successive relaying (SR) networks is their ability to mimic the full-duplex (FD) operation with half-duplex (HD) relays. However, the main challenge that comes with such schemes is the associated inter-relay interference (IRI). In this work, we propose a reconfigurable intelligent surface (RIS)-enhanced SR network, where one RIS is deployed near each of the two relay nodes to provide spatial suppression of IRI, and to maximize the gain of desired signals. The resultant max-min optimization problem with joint phase-shift design for both RISs is first tackled via the semidef…
In this paper, we propose different practical distributed schemes to solve the rank failure problem in the compute and forward (CMF)-based multi-user multi-relay networks without central coordinator, in which the relays have no prior information about each other. First, a new relaying strategy based on CMF, named incremental compute-and-forward (ICMF), is proposed that performs quite well in terms of the outage probability. We show that the distributed ICMF scheme can even outperform the achievable rate of centralized optimal CMF in strong enough inter relay links, with much less complexity. T…
In this paper we study and analyze coverage region for half-duplex multiple-input multiple-output (MIMO) relay channel with amplify-and-forward (AF) strategy at the relay station. By assuming mixed Rayleigh and Rician fading channels with two different relay station situations, we consider the objective of maximizing coverage region for a given transmission rate and find the optimal relay location in the sense of maximizing coverage region. using Monte Carlo simulations, the coverage region and capacity bounds are shown for different fading cases and different relay station locations. Finally,…
We propose an achievable rate-region for the two-way multiple-relay channel using decode-and-forward block Markovian coding. We identify a conflict between the information flow in both directions. This conflict leads to an intractable number of decode-forward schemes and achievable rate regions, none of which are universally better than the others. We introduce a new concept in decode-forward coding called ranking, and discover that there is an underlying structure to all of these rate regions expressed in the rank assignment. Through this discovery, we characterize the complete achievable rat…
This paper demonstrates the significant gains that multi-access users can achieve from sharing a single amplify-forward relay in slow fading environments. The proposed protocol, namely the multi-access relay amplify-forward, allows for a low-complexity relay and achieves the optimal diversity-multiplexing trade-off at high multiplexing gains. Analysis of the protocol reveals that it uniformly dominates the compress-forward strategy and further outperforms the dynamic decode-forward protocol at high multiplexing gains. An interesting feature of the proposed protocol is that, at high multiplexin…
We analyze the achievable rate of the superposition of block Markov encoding (decode-and-forward) and side information encoding (compress-and-forward) for the three-node Gaussian relay channel. It is generally believed that the superposition can out perform decode-and-forward or compress-and-forward due to its generality. We prove that within the class of Gaussian distributions, this is not the case: the superposition scheme only achieves a rate that is equal to the maximum of the rates achieved by decode-and-forward or compress-and-forward individually. We also present a superposition scheme …
The L-user additive white Gaussian noise multiway relay channel is investigated, where L users exchange information at the same rate through a single relay. A new achievable rate region, based on the functional-decode-forward coding strategy, is derived. For the case where there are three or more users, and all nodes transmit at the same power, the capacity is obtained. For the case where the relay power scales with the number of users, it is shown that both compress-forward and functional-decode-forward achieve rates within a constant number of bits of the capacity at all SNR levels; in addit…
