Related papers: Partial Decode-Forward Relaying for the Gaussian T…
This paper provides comprehensive coding and outer bound for the half-duplex multiple access channel with generalized feedback (MAC-GF). Two users communicate with one destination over a discrete memoryless channel using time division. Each…
We consider a half-duplex diamond relay channel, which consists of one source-destination pair and two relay nodes connected with two-way rate-limited out-of-band conferencing links. Three basic schemes and their achievable rates are…
The two user Gaussian interference channel with a full-duplex relay is studied. By using genie aided approaches, two new upper bounds on the achievable sum-rate in this setup are derived. These upper bounds are shown to be tighter than…
In this paper, we present a new cooperative communication scheme consisting of two users in half-duplex mode communicating with one destination over a discrete memoryless channel. The users encode messages in independent blocks and divide…
We consider the Gaussian interference channel with an intermediate relay as a main building block for cooperative interference networks. On the achievability side, we consider compress-and-forward based strategies. Specifically, a…
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…
The cut-set bound developed by Cover and El Gamal in 1979 has since remained the best known upper bound on the capacity of the Gaussian relay channel. We develop a new upper bound on the capacity of the Gaussian primitive relay channel…
The cut-set bound developed by Cover and El Gamal in 1979 has since remained the best known upper bound on the capacity of the Gaussian relay channel. We develop a new upper bound on the capacity of the Gaussian primitive relay channel…
Two types of noise-free relay cascades are investigated. Networks where a source communicates with a distant receiver via a cascade of half-duplex constrained relays, and networks where not only the source but also a single relay node…
We present a superposition coding scheme for communication over a network, which combines partial decode and forward and noisy network coding. This hybrid scheme is termed as superposition noisy network coding. The scheme is designed and…
In this paper, we investigate the capacity of the Gaussian two-hop full-duplex (FD) relay channel with residual self-interference. This channel is comprised of a source, an FD relay, and a destination, where a direct source-destination link…
We consider a communication system where two transmitters wish to exchange information through a half-duplex relay in the middle. The channels between the transmitters and the relay have asymmetric channel gains. More specifically, the…
In a bi-directional relay channel, a pair of nodes wish to exchange independent messages over a shared wireless half-duplex channel with the help of relays. Recent work has mostly considered information theoretic limits of the…
In this paper, we study a routing problem on the Gaussian multiple relay channel, in which nodes employ a decode-and-forward coding strategy. We are interested in routes for the information flow through the relays that achieve the highest…
This paper investigates the capacity of a wireless two way relay channel in which two end nodes exchange information via a relay node. The capacity is defined in the information-theoretic sense as the maximum information exchange rate…
In a bi-directional relay channel, two nodes wish to exchange independent messages over a shared wireless half-duplex channel with the help of relays. Recent work has considered information theoretic limits of the bi-directional relay…
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…
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…
The capacity regions are investigated for two relay broadcast channels (RBCs), where relay links are incorporated into standard two-user broadcast channels to support user cooperation. In the first channel, the Partially Cooperative Relay…
The Compute-and-Forward relaying strategy achieves high computation rates by decoding linear combinations of transmitted messages at intermediate relays. However, if the involved relays independently choose which combinations of the…