English
Related papers

Related papers: Linear Sum Capacity for Gaussian Multiple Access C…

200 papers

This paper studies the noncausal relay channel, also known as the relay channel with unlimited lookahead, introduced by El Gamal, Hassanpour, and Mammen. Unlike the standard relay channel model, where the relay encodes its signal based on…

Information Theory · Computer Science 2017-04-20 Lele Wang , Mohammad Naghshvar

Consider a pair of terminals connected by two independent additive white Gaussian noise channels, and limited by individual power constraints. The first terminal would like to reliably send information to the second terminal, within a given…

Information Theory · Computer Science 2014-12-16 Assaf Ben-Yishai , Ofer Shayevitz

This paper considers the two-user Gaussian interference channel in the presence of adversarial jammers. We first provide a general model including an arbitrary number of jammers, and show that its capacity region is equivalent to that of a…

Information Theory · Computer Science 2017-12-13 Fatemeh Hosseinigoki , Oliver Kosut

The capacity of unifilar finite-state channels in the presence of feedback is investigated. We derive a new evaluation method to extract graph-based encoders with their achievable rates, and to compute upper bounds to examine their…

Information Theory · Computer Science 2019-07-19 Oron Sabag , Bashar Huleihel , Haim Permuter

This paper investigates the capacity and capacity per unit cost of Gaussian multiple access-channel (GMAC) with peak power constraints. We first devise an approach based on Blahut-Arimoto Algorithm to numerically optimize the sum rate and…

Information Theory · Computer Science 2015-02-24 Siavash Ghavami , Farshad Lahouti

A cache-aided $K$-user Gaussian broadcast channel (BC) is considered. The transmitter has a library of $N$ equal-rate files, from which each user demands one. The impact of the equal-capacity receiver cache memories on the minimum required…

Information Theory · Computer Science 2018-05-01 Mohammad Mohammadi Amiri , Deniz Gunduz

The problem of three-user multiple-access channel (MAC) with noiseless feedback is investigated. A new coding strategy is presented. The coding scheme builds upon the natural extension of the Cover-Leung (CL) scheme; and uses quasi-linear…

Information Theory · Computer Science 2017-02-21 Mohsen Heidari , Farhad Shirani , S. Sandeep Pradhan

It is well known that the problem of computing the feedback capacity of a stationary Gaussian channel can be recast as an infinite-dimensional optimization problem; moreover, necessary and sufficient conditions for the optimality of a…

Information Theory · Computer Science 2018-01-10 Tao Liu , Guangyue Han

We investigate asymptotic capacity limits of the Gaussian MIMO broadcast channel (BC) with spatially correlated fading to understand when and how much transmit correlation helps the capacity. By imposing a structure on channel covariances…

Information Theory · Computer Science 2014-10-13 Junyoung Nam

It is known that the capacity of parallel (multi-carrier) Gaussian point-to-point, multiple access and broadcast channels can be achieved by separate encoding for each subchannel (carrier) subject to a power allocation across carriers. In…

Information Theory · Computer Science 2016-11-17 Viveck R. Cadambe , Syed A. Jafar

In this paper, the capacity region of the linear deterministic interference channel with noisy channel-output feedback (LD-IC-NF) is fully characterized. The proof of achievability is based on random coding arguments and rate splitting;…

Information Theory · Computer Science 2018-05-22 Victor Quintero , Samir M. Perlaza , Iñaki Esnaola , Jean-Marie Gorce

The problem of characterizing the capacity region for Gaussian broadcast channels with receiver message side information appears difficult and remains open for N >= 3 receivers. This paper proposes a joint network and Gelfand-Pinsker coding…

Information Theory · Computer Science 2014-08-21 Jin Sima , Wei Chen

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

Recent investigations have shown that the sum secure degrees of freedom of the Gaussian wiretap channel with a helper is $\tfrac{1}{2}$. The achievable scheme for this result is based on the real interference alignment approach. While…

Information Theory · Computer Science 2016-09-19 Rick Fritschek , Gerhard Wunder

We consider transmission of two independent and separately encoded sources over a two-user binary-input Gaussian multiple-access channel. The channel gains are assumed to be unknown at the transmitter and the goal is to design an…

Information Theory · Computer Science 2011-10-04 Arvind Yedla , Phong S. Nguyen , Henry D. Pfister , Krishna R. Narayanan

We study private classical communication over quantum multiple-access channels. For an arbitrary number of transmitters, we derive a regularized expression of the capacity region. In the case of degradable channels, we establish a…

Information Theory · Computer Science 2022-01-31 Remi A. Chou

In the recent paper [1] it is shown, via an application example, that the Cover and Pombra [2] "characterization of the $n-$block or transmission" feedback capacity formula, of additive Gaussian noise (AGN) channels, is the subject of much…

Information Theory · Computer Science 2020-10-14 Charalambos D. Charalambous , Christos Kourtellaris , Stelios Louka

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 capacity of discrete-time channels with feedback for the general case where the feedback is a time-invariant deterministic function of the output samples. Under the assumption that the channel states take values in a finite…

Information Theory · Computer Science 2009-09-29 Haim Permuter , Tsachy Weissman , Andrea Goldsmith

This paper considers the three-way channel, consisting of three nodes, where each node broadcasts a message to the two other nodes. The capacity of the finite-field three-way channel is derived, and is shown to be achievable using a…

Information Theory · Computer Science 2013-01-11 Lawrence Ong