English
Related papers

Related papers: Partial Decode-Forward Relaying for the Gaussian T…

200 papers

Relay networks having $n$ source-to-destination pairs and $m$ half-duplex relays, all operating in the same frequency band in the presence of block fading, are analyzed. This setup has attracted significant attention and several relaying…

Information Theory · Computer Science 2016-11-15 Shengshan Cui , Alexander M. Haimovich , Oren Somekh , H. Vincent Poor

Although extensively investigated, the capacity of the two-hop half-duplex (HD) relay channel is not fully understood. In particular, a capacity expression which can be easily evaluated is not available and an explicit coding scheme which…

Information Theory · Computer Science 2015-11-18 Nikola Zlatanov , Vahid Jamali , Derrick Wing Kwan Ng , Robert

Although extensively investigated, the capacity of the two-hop half-duplex (HD) relay channel is not fully understood. In particular, a capacity expression which can be evaluated straightforwardly is not available and an explicit coding…

Information Theory · Computer Science 2015-10-13 Nikola Zlatanov , Vahid Jamali , Robert Schober

This paper investigates low-latency streaming codes for a three-node relay network. The source transmits a sequence of messages (streaming messages) to the destination through the relay between them, where the first-hop channel from the…

Information Theory · Computer Science 2022-03-14 Silas L. Fong , Ashish Khisti , Baochun Li , Wai-Tian Tan , Xiaoqing Zhu , John Apostolopoulos

We derive expressions for the achievable rate region of a collaborative coding scheme in a two-transmitter, two-receiver Pairwise Collaborative Network (PCN) where one transmitter and receiver pair, namely relay pair, assists the other…

Information Theory · Computer Science 2008-07-08 Saeed A. Astaneh , Saeed Gazor , Hamid Behroozi

Recently, it has been shown that a quantize-map-and-forward scheme approximately achieves (within a constant number of bits) the Gaussian relay network capacity for arbitrary topologies. This was established using Gaussian codebooks for…

Information Theory · Computer Science 2015-03-17 Ayfer Ozgur , Suhas Diggavi

This paper focuses on the capacity of point-to-point relay communications wherein the transmitter is assisted by an intermediate relay. We detail the mathematical model of cutset and amplify and forward (AF) relaying strategy. We present…

Information Theory · Computer Science 2013-01-15 Farshad Shams , Marco Luise

We investigate the binary-symmetric parallel-relay network where there is one source, one destination, and multiple relays in parallel. We show that forwarding relays, where the relays merely transmit their received signals, achieve the…

Information Theory · Computer Science 2014-03-11 Lawrence Ong , Sarah J. Johnson , Christopher M. Kellett

This paper considers Gaussian half-duplex diamond $n$-relay networks, where a source communicates with a destination by hopping information through one layer of $n$ non-communicating relays that operate in half-duplex. The main focus…

Information Theory · Computer Science 2020-01-10 Sarthak Jain , Soheil Mohajer , Martina Cardone

This paper studies incremental relay strategies for a two-user Gaussian relay-interference channel with an in-band-reception and out-of-band-transmission relay, where the link between the relay and the two receivers is modelled as a…

Information Theory · Computer Science 2012-12-13 Lei Zhou , Wei Yu

Consider a relay cascade, i.e. a network where a source node, a sink node and a certain number of intermediate source/relay nodes are arranged on a line and where adjacent node pairs are connected by error-free (q+1)-ary pipes. Suppose the…

Information Theory · Computer Science 2016-11-17 Tobias Lutz , Christoph Hausl , Ralf Kötter

In this work, we consider a dual-hop, decode-and-forward network where the relay can operate in full- duplex (FD) or half-duplex (HD) mode. We model the residual self-interference as an additive Gaussian noise with variance proportional to…

Information Theory · Computer Science 2017-08-07 Alessandro Nordio , Carla Fabiana Chiasserini , Emanuele Viterbo

A noisy network coding scheme for sending multiple sources over a general noisy network is presented. For multi-source multicast networks, the scheme naturally extends both network coding over noiseless networks by Ahlswede, Cai, Li, and…

Information Theory · Computer Science 2015-03-13 Sung Hoon Lim , Young-Han Kim , Abbas El Gamal , Sae-Young Chung

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…

Information Theory · Computer Science 2014-10-01 Lennart Gerdes , Christoph Hellings , Lorenz Weiland , Wolfgang Utschick

This paper addresses network code design for robust transmission of sources over an orthogonal two-hop wireless network with a broadcasting relay. The network consists of multiple sources and destinations in which each destination,…

Information Theory · Computer Science 2016-11-15 Roghayeh Joda , Farshad Lahouti

In this paper, we show that the capacity of the three-node Gaussian relay channel can be achieved to within 1 and 2 bit/sec/Hz using compress-and-forward and amplify-and-forward relaying, respectively.

Information Theory · Computer Science 2010-11-24 Woohyuk Chang , Sae-Young Chung , Yong H. Lee

This paper studies networks with N half-duplex relays assisting the communication between a source and a destination. In ISIT'12 Brahma, \"{O}zg\"{u}r and Fragouli conjectured that in Gaussian half-duplex diamond networks (i.e., without a…

Information Theory · Computer Science 2016-11-17 Martina Cardone , Daniela Tuninetti , Raymond Knopp

We analyze the performance of a system composed of two interfering point-to-point links where the transmitters can exploit a common relay to improve their individual transmission rate. When the relay uses the amplify-and-forward protocol we…

Information Theory · Computer Science 2009-04-20 Brice Djeumou , Elena Veronica Belmega , Samson Lasaulce

The capacity or approximations to capacity of various single-source single-destination relay network models has been characterized in terms of the cut-set upper bound. In principle, a direct computation of this bound requires evaluating the…

Information Theory · Computer Science 2011-11-21 Farzad Parvaresh , Raul Etkin

Consider a Gaussian relay network where a number of sources communicate to a destination with the help of several layers of relays. Recent work has shown that a compress-and-forward based strategy at the relays can achieve the capacity of…

Information Theory · Computer Science 2013-04-30 Ritesh Kolte , Ayfer Özgür