English
Related papers

Related papers: Improved Capacity Approximations for Gaussian Rela…

200 papers

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

We present a deterministic channel model which captures several key features of multiuser wireless communication. We consider a model for a wireless network with nodes connected by such deterministic channels, and present an exact…

Information Theory · Computer Science 2007-10-23 A. S. Avestimehr , S. N. Diggavi , D. N. C. Tse

This paper characterizes the capacity of a class of modulo additive noise relay channels, in which the relay observes a corrupted version of the noise and has a separate channel to the destination. The capacity is shown to be strictly below…

Information Theory · Computer Science 2016-09-08 Marko Aleksic , Peyman Razaghi , Wei Yu

A full-duplex wireless network with three users that want to establish full message-exchange via a relay is considered. Thus, the network known as the Y-channel has a total of 6 messages, 2 outgoing and 2 incoming at each user. The users…

Information Theory · Computer Science 2013-10-08 Anas Chaaban , Aydin Sezgin

We consider a state-dependent full-duplex relay channel with the state of the channel non-causally available at only the relay. In the framework of cooperative wireless networks, some specific terminals can be equipped with cognition…

Information Theory · Computer Science 2016-11-17 Abdellatif Zaidi , Shivaprasad Kotagiri , J. Nicholas Laneman , Luc Vandendorpe

The multicast capacity of the Gaussian two-hop relay network with one source, $N$ relays, and $L$ destinations is studied. It is shown that a careful modification of the partial decode--forward coding scheme, whereby the relays cooperate…

Information Theory · Computer Science 2015-08-04 Jing Li , Young-Han Kim

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

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

For every Gaussian relay network with a single source-destination pair, it is known that there exists a corresponding deterministic network called the discrete superposition network that approximates its capacity uniformly over all SNR's to…

Information Theory · Computer Science 2016-11-17 M. Anand , P. R. Kumar

We study the input-entropy-constrained Gaussian channel capacity problem in the asymptotic high signal-to-noise ratio (SNR) regime. We show that the capacity-achieving distribution as SNR goes to infinity is given by a discrete Gaussian…

Information Theory · Computer Science 2026-01-16 Adway Girish , Shlomo Shamai , Emre Telatar

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

A classical result in Information Theory states that the Gaussian noise is the worst-case additive noise in point-to-point channels, meaning that, for a fixed noise variance, the Gaussian noise minimizes the capacity of an additive noise…

Information Theory · Computer Science 2013-01-30 Ilan Shomorony , A. Salman Avestimehr

We consider the problem of information flow over Gaussian relay networks. Similar to the recent work by Avestimehr \emph{et al.} [1], we propose network codes that achieve up to a constant gap from the capacity of such networks. However,…

Information Theory · Computer Science 2011-02-28 Theodoros K. Dikaliotis , Hongyi Yao , Salman Avestimehr , Sidharth Jaggi , Tracey Ho

Uplink-downlink duality refers to the fact that under a sum-power constraint, the capacity regions of a Gaussian multiple-access channel and a Gaussian broadcast channel with Hermitian transposed channel matrices are identical. This paper…

Information Theory · Computer Science 2021-08-27 Liang Liu , Ya-Feng Liu , Pratik Patil , Wei Yu

This paper derives upper and lower bounds on the capacity of the multiple-input single-output free-space optical intensity channel with signal-independent additive Gaussian noise subject to both an average-intensity and a peak-intensity…

Information Theory · Computer Science 2017-10-26 Stefan M. Moser , Ligong Wang , Michèle Wigger

This paper revisits the Gaussian degraded relay channel, where the link that carries information from the source to the destination is a physically degraded version of the link that carries information from the source to the relay. The…

Information Theory · Computer Science 2016-10-19 Silas L. Fong , Vincent Y. F. Tan

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 capacity of a complex and discrete-time memoryless additive white Gaussian noise (AWGN) channel under three constraints, namely, input average power, input amplitude and output delivered power is studied. The output delivered power…

Information Theory · Computer Science 2020-04-27 Morteza Varasteh , Borzoo Rassouli , Bruno Clerckx

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 investigates the capacity of a communications channel that, in addition to additive white Gaussian noise, also suffers from interference caused by a co-existing radar transmission. The radar interference (of short duty-cycle and…

Information Theory · Computer Science 2018-10-16 Sara Shahi , Daniela Tuninetti , Natasha Devroye