English
Related papers

Related papers: Capacity Approximations for Gaussian Relay Network…

200 papers

For every Gaussian network, there exists a corresponding deterministic network called the discrete superposition network. We show that this discrete superposition network provides a near-optimal digital interface for operating a class…

Information Theory · Computer Science 2015-03-17 M. Anand , P. R. Kumar

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…

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

Energy Harvesting (EH) is a novel technique to prolong the lifetime of the wireless networks such as wireless sensor networks or Ad-Hoc networks, by providing an unlimited source of energy for their nodes. In this sense, it has emerged as a…

Information Theory · Computer Science 2021-04-07 Mahmood Mohassel Feghhi , Aliazam Abbasfar , Mahtab Mirmohseni

Lattice codes are known to achieve capacity in the Gaussian point-to-point channel, achieving the same rates as independent, identically distributed (i.i.d.) random Gaussian codebooks. Lattice codes are also known to outperform random codes…

Information Theory · Computer Science 2012-10-23 Yiwei Song , Natasha Devroye

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

A bound on the maximum information transmission rate through a cascade of Gaussian links is presented. The network model consists of a source node attempting to send a message drawn from a finite alphabet to a sink, through a cascade of…

Information Theory · Computer Science 2013-01-29 Ramanan Subramanian , Badri Vellambi , Ingmar Land

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

The capacity of a relay channel with inter-symbol interference (ISI) and additive colored Gaussian noise is examined under an input power constraint. Prior results are used to show that the capacity of this channel can be computed by…

Information Theory · Computer Science 2011-03-02 Chiranjib Choudhuri , Urbashi Mitra

Establishing the capacity region of a Gaussian interference network is an open problem in information theory. Recent progress on this problem has led to the characterization of the capacity region of a general two user Gaussian interference…

Information Theory · Computer Science 2009-02-15 V. Sreekanth Annapureddy , Venugopal V. Veeravalli

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 of a class of Interference Relay Channels (IRC) -the Injective Semideterministic IRC where the relay can only observe one of the sources- is investigated. We first derive a novel outer bound and two inner bounds which are based…

Information Theory · Computer Science 2016-09-28 Germán Bassi , Pablo Piantanida , Sheng Yang

We obtain a new upper bound on the capacity of a class of discrete memoryless relay channels. For this class of relay channels, the relay observes an i.i.d. sequence $T$, which is independent of the channel input $X$. The channel is…

Information Theory · Computer Science 2008-10-07 Ravi Tandon , Sennur Ulukus

We consider a three-terminal state-dependent relay channel with the channel state available non-causally at only the source. Such a model may be of interest for node cooperation in the framework of cognition, i.e., collaborative signal…

Information Theory · Computer Science 2016-11-17 Abdellatif Zaidi , Shlomo Shamai , Pablo Piantanida , Luc Vandendorpe

The secrecy capacity of relay channels with orthogonal components is studied in the presence of an additional passive eavesdropper node. The relay and destination receive signals from the source on two orthogonal channels such that the…

Information Theory · Computer Science 2009-06-09 Vaneet Aggarwal , Lalitha Sankar , A. Robert Calderbank , H. Vincent Poor

In this paper, we derive upper and lower bounds as well as a simple closed-form approximation for the capacity of the continuous-time, bandlimited, additive white Gaussian noise channel in a three-dimensional free-space electromagnetic…

Information Theory · Computer Science 2017-02-27 Richard J. Barton

For the additive Gaussian noise channel with average codeword power constraint, sparse superposition codes and adaptive successive decoding is developed. Codewords are linear combinations of subsets of vectors, with the message indexed by…

Information Theory · Computer Science 2010-06-22 Andrew R Barron , Antony Joseph

A new outer bound on the capacity region of Gaussian interference channels is developed. The bound combines and improves existing genie-aided methods and is shown to give the sum-rate capacity for noisy interference as defined in this…

Information Theory · Computer Science 2016-11-18 Xiaohu Shang , Gerhard Kramer , Biao Chen

We consider a line network of nodes, connected by additive white Gaussian noise channels, equipped with local feedback. We study the velocity at which information spreads over this network. For transmission of a data packet, we give an…

Information Theory · Computer Science 2024-10-28 Elad Domanovitz , Anatoly Khina , Tal Philosof , Yuval Kochman

In this paper, we derive the capacity of a special class of mesh networks. A mesh network is defined as a heterogeneous wireless network in which the transmission among power limited nodes is assisted by powerful relays, which use the same…

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

We consider a three-node half-duplex Gaussian relay network where two nodes (say $a$, $b$) want to communicate with each other and the third node acts as a relay for this twoway communication. Outer bounds and achievable rate regions for…

Information Theory · Computer Science 2012-10-09 Ishaque Ashar K. , Prathyusha V. , Srikrishna Bhashyam , Andrew Thangaraj