English
Related papers

Related papers: Noisy Channel-Output Feedback Capacity of the Line…

200 papers

The linear shift deterministic Y-channel is studied. That is, we have three users and one relay, where each user wishes to broadcast one message to each other user via the relay, resulting in a multi-way relaying setup. The cut-set bounds…

Information Theory · Computer Science 2015-03-19 Anas Chaaban , Aydin Sezgin

We develop a characterization of fading models, which assigns a number called logarithmic Jensen's gap to a given fading model. We show that as a consequence of a finite logarithmic Jensen's gap, approximate capacity region can be obtained…

Information Theory · Computer Science 2018-06-05 Joyson Sebastian , Can Karakus , Suhas Diggavi

Motivated by results in optical communications, where the performance can degrade dramatically if the transmit power is sufficiently increased, the channel capacity is characterized for various kinds of memoryless vector channels. It is…

Information Theory · Computer Science 2015-03-20 Erik Agrell

Variable length communication over a compound channel with feedback is considered. Traditionally, capacity of a compound channel without feedback is defined as the maximum rate that is determined before the start of communication such that…

Information Theory · Computer Science 2011-06-30 Aditya Mahajan , Sekhar Tatikonda

Achievable rate regions for cooperative relay broadcast channels with rate-limited feedback are proposed. Specifically, we consider two-receiver memoryless broadcast channels where each receiver sends feedback signals to the transmitter…

Information Theory · Computer Science 2016-05-09 Youlong Wu

In this paper, we investigate the additive Gaussian noise channel with noisy feedback. We consider the setup of linear coding of the feedback information and Gaussian signaling of the message (i.e. Cover-Pombra Scheme). Then, we derive the…

Information Theory · Computer Science 2015-03-19 Chong Li , Nicola Elia

Recently, Etkin, Tse, and Wang found the capacity region of the two-user Gaussian interference channel to within one bit/s/Hz. A natural goal is to apply this approach to the Gaussian interference channel with an arbitrary number of users.…

Information Theory · Computer Science 2016-11-17 Guy Bresler , Abhay Parekh , David Tse

The capacity regions of multiple-input multiple-output Gaussian Z-interference channels are established for the very strong interference and aligned strong interference cases. The sum-rate capacity of such channels is established under…

Information Theory · Computer Science 2009-11-25 Xiaohu Shang , Biao Chen , Gerhard Kramer , H. Vincent Poor

We study the capacity of discrete memoryless many-to-one interference channels, i.e., K user interference channels where only one receiver faces interference. For a class of many-to-one interference channels, we identify a noisy…

Information Theory · Computer Science 2009-12-17 Viveck R. Cadambe , Syed A. Jafar

An achievable rate region for certain noisy three-user-pair interference channels is proposed. The channel class under consideration generalizes the three-pair deterministic interference channel (3-DIC) in the same way as the Telatar-Tse…

Information Theory · Computer Science 2016-11-17 Bernd Bandemer

The fundamental limits of communication over state-dependent discrete memoryless channels with noiseless feedback are studied, under the assumption that the communicating parties are allowed to use variable-length coding schemes. Various…

Information Theory · Computer Science 2020-08-13 Mladen Kovačević , Carol Wang , Vincent Y. F. Tan

This paper considers the K user cognitive interference channel with one primary and K-1 secondary/cognitive transmitters with a cumulative message sharing structure, i.e cognitive transmitter $i\in [2:K]$ knows non-causally all messages of…

Information Theory · Computer Science 2013-01-29 Diana Maamari , Daniela Tuninetti , Natasha Devroye

The capacity region of the 2-user multi-input multi-output (MIMO) Gaussian interference channel (IC) is characterized to within a constant gap that is independent of the channel matrices for the general case of the MIMO IC with an arbitrary…

Information Theory · Computer Science 2015-03-18 Sanjay Karmakar , Mahesh K. Varanasi

A formula is derived for the capacity of the Gaussian channel with a benevolent message-cognizant rate-limited helper that provides a noncausal description of the noise to the encoder and decoder. This capacity is strictly larger than when…

Information Theory · Computer Science 2023-10-25 Amos Lapidoth , Ligong Wang , Yiming Yan

The capacity region of the cooperative two-user Multiple Access Channel (MAC) in Gaussian noise is determined to within a constant gap for both the Full-Duplex (FD) and Half-Duplex (HD) case. The main contributions are: (a) for both FD and…

Information Theory · Computer Science 2016-11-18 Daniela Tuninetti

In this work, the role of unidirectional limited rate transmitter cooperation is studied in the case of the 2-user Z interference channel (Z-IC) with secrecy constraints at the receivers, on achieving two conflicting goals simultaneously:…

Information Theory · Computer Science 2016-04-11 Parthajit Mohapatra , Chandra R. Murthy , Jemin Lee

In this paper, a channel that is contaminated by two independent Gaussian noises $S ~ N(0,Q)$ and $Z_0 ~ N(0,N_0)$ is considered. The capacity of this channel is computed when independent noisy versions of $S$ are known to the transmitter…

Information Theory · Computer Science 2008-06-18 Yong Peng , Dinesh Rajan

The reliability function of memoryless channels with noiseless feedback and variable-length coding has been found to be a linear function of the average rate in the classic work of Burnashev. In this work we consider unifilar channels with…

Information Theory · Computer Science 2017-07-11 Achilleas Anastasopoulos , Jui Wu

Relay networks aid in increasing the rate of communication from source to destination. However, the capacity of even a three-terminal relay channel is an open problem. In this work, we propose a new lower bound for the capacity of the…

Information Theory · Computer Science 2016-11-17 Mayur Agrawal , David Love , Venkataramanan Balakrishnan

We consider the problem of multiple-input single-output Broadcast Channels with Rayleigh fading where the transmitter has access to delayed knowledge of the channel state information. We first characterize the capacity region of this…

Information Theory · Computer Science 2016-06-23 Alireza Vahid , Mohammad Ali Maddah-Ali , Amir Salman Avestimehr