English
Related papers

Related papers: On Gaussian Half-Duplex Relay Networks

200 papers

This paper considers a general Gaussian relay network where a source transmits a message to a destination with the help of N half-duplex relays. It proves that the information theoretic cut-set upper bound to the capacity can be achieved to…

Information Theory · Computer Science 2016-11-15 Martina Cardone , Daniela Tuninetti , Raymond Knopp , Umer Salim

We study a multi-source Gaussian relay network consisting of $K$ source--destination pairs having $K$ unicast sessions. We assume $M$ layers of relays between the sources and the destinations. We find achievable degrees of freedom of the…

Information Theory · Computer Science 2009-10-20 Sang-Woon Jeon , Sae-Young Chung , Syed A. Jafar

In this paper, a Gaussian two-way relay channel, where two source nodes exchange messages with each other through a relay, is considered. We assume that all nodes operate in full-duplex mode and there is no direct channel between the source…

Information Theory · Computer Science 2009-02-17 Wooseok Nam , Sae-Young Chung , Yong H. Lee

We introduce a generalized two-way relay channel where two sources exchange information (not necessarily of the same rate) with help from a relay, and each source additionally sends private information to the relay. We consider the Gaussian…

Information Theory · Computer Science 2016-11-15 Chin Keong Ho , Kiran T. Gowda , Sumei Sun

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

In this paper, we consider the Gaussian diamond-wiretap channel that consists of an orthogonal broadcast channel from a source to two relays and a Gaussian fast-fading multiple access-wiretap channel from the two relays to a legitimate…

Information Theory · Computer Science 2015-12-22 Si-Hyeon Lee , Wanyao Zhao , Ashish Khisti

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

We consider the Gaussian N-relay diamond network, where a source wants to communicate to a destination node through a layer of N-relay nodes. We investigate the following question: what fraction of the capacity can we maintain by using only…

Information Theory · Computer Science 2012-11-16 Caner Nazaroglu , Ayfer Ozgur , Christina Fragouli

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

We study the capacity of the full-duplex bidirectional (or two-way) relay channel with two nodes and one relay. The channels in the forward direction are assumed to be different (in general) than the channels in the backward direction, i.e.…

Information Theory · Computer Science 2008-08-26 Amir Salman Avestimehr , Aydin Sezgin , David N. C. Tse

Consider a Gaussian relay network where a source node communicates to a destination node with the help of several layers of relays. Recent work has shown that compress-and-forward based strategies can achieve the capacity of this network…

Information Theory · Computer Science 2015-07-16 Ritesh Kolte , Ayfer Özgür , Abbas El Gamal

We present an achievable rate for general Gaussian relay networks. We show that the achievable rate is within a constant number of bits from the information-theoretic cut-set upper bound on the capacity of these networks. This constant…

Information Theory · Computer Science 2016-11-17 Amir Salman Avestimehr , Suhas N. Diggavi , David N C. Tse

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

We derive the capacity of the state-dependent half-duplex relay channel without source-destination link. The output of the state-dependent half-duplex relay channel depends on the randomly varying channel states of the source-relay and…

Information Theory · Computer Science 2014-02-25 Nikola Zlatanov , Robert Schober

We examine the extent to which Gaussian relay networks can be approximated by deterministic networks, and present two results, one negative and one positive. The gap between the capacities of a Gaussian relay network and a corresponding…

Information Theory · Computer Science 2009-08-10 M. Anand , P. R. Kumar

In this paper, protocols for the half-duplex relay channel are introduced and performance limits are analyzed. Relay nodes underly an orthogonality constraint, which prohibits simultaneous receiving and transmitting on the same…

Information Theory · Computer Science 2010-02-02 Peter Rost , Gerhard Fettweis

The capacity region of multi-pair bidirectional relay networks, in which a relay node facilitates the communication between multiple pairs of users, is studied. This problem is first examined in the context of the linear shift deterministic…

Information Theory · Computer Science 2016-11-17 Aydin Sezgin , A. Salman Avestimehr , M. Amin Khajehnejad , Babak Hassibi

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…

Information Theory · Computer Science 2010-02-02 Sang Joon Kim , Besma Smida , Natasha Devroye

This paper studies Gaussian Two-Way Relay Channel where two communication nodes exchange messages with each other via a relay. It is assumed that all nodes operate in half duplex mode without any direct link between the communication nodes.…

Information Theory · Computer Science 2016-11-17 Sinda Smirani , Mohamed Kamoun , Mireille Sarkiss , Abdellatif Zaidi , Pierre Duhamel

We consider two-source two-destination (i.e., two-unicast) multi-hop wireless networks that have a layered structure with arbitrary connectivity. We show that, if the channel gains are chosen independently according to continuous…

Information Theory · Computer Science 2015-03-18 Ilan Shomorony , A. Salman Avestimehr
‹ Prev 1 2 3 10 Next ›