English
Related papers

Related papers: On Maximizing Coverage in Gaussian Relay Networks

200 papers

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…

Information Theory · Computer Science 2008-05-23 Caleb K. Lo , Sriram Vishwanath , Robert W. Heath

It is known that circularly symmetric Gaussian signals are the optimal input signals for the partial decode-and-forward (PDF) coding scheme in the Gaussian multiple-input multiple-output (MIMO) relay channel, but there is currently no…

Information Theory · Computer Science 2019-11-15 Christoph Hellings , Patrick Gest , Thomas Wiegart , Wolfgang Utschick

Deploying relays and/or mobile base stations is a major means of extending the coverage of a wireless network. This paper presents models, analytical results, and algorithms to answer two related questions: The first is where to deploy…

Information Theory · Computer Science 2014-08-29 Xu Li , Dongning Guo , John Grosspietsch , Huarui Yin , Guo Wei

As a basic information-theoretic model for fading relay channels, the parallel relay channel is first studied, for which lower and upper bounds on the capacity are derived. For the parallel relay channel with degraded subchannels, the…

Information Theory · Computer Science 2007-07-13 Yingbin Liang , Venugopal V. Veeravalli , H. Vincent Poor

Lossy transmission over a relay channel in which the relay has access to correlated side information is considered. First, a joint source-channel decode-and-forward scheme is proposed for general discrete memoryless sources and channels.…

Information Theory · Computer Science 2016-11-17 Deniz Gunduz , Elza Erkip , Andrea J. Goldsmith , H. Vincent Poor

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…

Information Theory · Computer Science 2022-11-30 Shubhransh Singhvi , Gayathri R. , P. Vijay Kumar

In this paper, we study the interference relay-without-delay channel which is an interference channel with a relay helping the communication. We assume the relay's transmit symbol depends not only on its past received symbols but also on…

Information Theory · Computer Science 2011-08-16 Hyunseok Chang , Sae-Young Chung

The problem of multicasting multiple messages with the help of a relay, which may also have an independent message of its own to multicast, is considered. As a first step to address this general model, referred to as the compound multiple…

Information Theory · Computer Science 2016-11-17 D. Gunduz , O. Simeone , A. Goldsmith , H. V. Poor , S. Shamai

We consider two-way relaying in a Gaussian diamond channel, where two terminal nodes wish to exchange information using two relays. A simple baseline protocol is obtained by time-sharing between two one-way protocols. To improve upon the…

Information Theory · Computer Science 2013-10-07 Prathyusha V , Srikrishna Bhashyam , Andrew Thangaraj

In this paper, we derive UWB version of (i) general best achievable rate for the relay channel with decode-andforward strategy and (ii) max-flow min-cut upper bound, such that the UWB relay channel can be studied considering the obtained…

Information Theory · Computer Science 2011-09-15 Maryam Faramarzi Yazd , Ghosheh Abed Hodtani

The relay channel, consisting of a source-destination pair along with a relay, is a fundamental component of cooperative communications. While the capacity of a general relay channel remains unknown, various relaying strategies, including…

Information Theory · Computer Science 2025-02-14 Ezgi Ozyilkan , Fabrizio Carpi , Siddharth Garg , Elza Erkip

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…

Information Theory · Computer Science 2007-10-24 P. Rost , G. Fettweis

In this paper, achievable rates regions are derived for power constrained Gaussian broadcast channel of two users using finite dimension constellations. Various transmission strategies are studied, namely superposition coding (SC) and…

Information Theory · Computer Science 2014-03-24 Zeina Mheich , Florence Alberge , Pierre Duhamel

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…

Information Theory · Computer Science 2007-11-20 P. Razaghi , W. Yu

Compute-and-forward (CF) harnesses interference in a wireless networkby allowing relays to compute combinations of source messages. The computed message combinations at relays are correlated, and so directly forwarding these combinations to…

Information Theory · Computer Science 2016-01-20 Yihua Tan , Xiaojun Yuan

The Gaussian parallel relay network, in which two parallel relays assist a source to convey information to a destination, was introduced by Schein and Gallager. An upper bound on the capacity can be obtained by considering broadcast cut…

Information Theory · Computer Science 2016-04-13 Satyajit Thakor , Syed Abbas

We investigate cooperative wireless relay networks in which the nodes can help each other in data transmission. We study different coding strategies in the single-source single-destination network with many relay nodes. Given the myriad of…

Information Theory · Computer Science 2010-04-15 Lawrence Ong , Mehul Motani

This work focuses on the half-duplex (HD) relaying based on the generalized quantize-and-forward (GQF) scheme in the slow fading Multiple Access Relay Channel (MARC) where the relay has no channel state information (CSI) of the…

Information Theory · Computer Science 2014-06-23 Ming Lei , Mohammad Reza Soleymani

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…

Information Theory · Computer Science 2010-08-16 Anas Chaaban , Aydin Sezgin

This paper studies the relaying strategies and the approximate capacity of the classic three-node Gaussian relay channel, but where the noises at the relay and at the destination are correlated. It is shown that the capacity of such a relay…

Information Theory · Computer Science 2011-10-25 Lei Zhou , Wei Yu