English
Related papers

Related papers: On the Capacity of Interference Channels with One …

200 papers

This paper considers a three-receiver broadcast channel with degraded message sets and message cognition. The model consists of a common message for all three receivers, a private common message for only two receivers and two additional…

Information Theory · Computer Science 2016-01-27 Ahmed S. Mansour , Rafael F. Schaefer , Holger Boche

We consider the two-user interference channel with rate-limited feedback. Related prior works focus on the case where feedback links have infinite capacity, while no research has been done for the rate-limited feedback problem. Several new…

Information Theory · Computer Science 2012-05-08 Alireza Vahid , Changho Suh , Amir Salman Avestimehr

The two-receiver broadcast packet erasure channel with feedback and memory is studied. Memory is modeled using a finite-state Markov chain representing a channel state. Outer and inner bounds on the capacity region are derived when the…

Information Theory · Computer Science 2014-11-11 Michael Heindlmaier , Navid Reyhanian , Shirin Saeedi Bidokhti

This paper investigates the capacity region of three-receiver AWGN broadcast channels where the receivers (i) have private-message requests and (ii) know the messages requested by some other receivers as side information. We classify these…

Information Theory · Computer Science 2014-09-04 Behzad Asadi , Lawrence Ong , Sarah J. Johnson

In this paper, we derive information-theoretic performance limits for three classes of two-user state-dependent discrete memoryless broadcast channels, with noncausal side-information at the encoder. The first class of channels comprises a…

Information Theory · Computer Science 2012-07-17 K. G. Nagananda , Chandra R. Murthy , Shalinee Kishore

This paper gives the approximate capacity region of a two-user MIMO interference channel with limited receiver cooperation, where the gap between the inner and outer bounds is in terms of the total number of receive antennas at the two…

Information Theory · Computer Science 2014-07-08 Mehdi Ashraphijuo , Vaneet Aggarwal , Xiaodong Wang

We study the capacity region of the two-user Binary Fading (or Erasure) Interference Channel where the transmitters have no knowledge of the channel state information. We develop new inner-bounds and outer-bounds for this problem. We…

Information Theory · Computer Science 2017-03-28 Alireza Vahid , Mohammad Ali Maddah-Ali , Amir Salman Avestimehr , Yan Zhu

In multi-user information theory it is often assumed that every node in the network possesses all codebooks used in the network. This assumption may be impractical in distributed ad-hoc, cognitive or heterogeneous networks. This work…

Information Theory · Computer Science 2014-10-03 Alex Dytso , Daniela Tuninetti , Natasha Devroye

An outer bound to the two-receiver discrete memoryless broadcast channel is presented. We compare it to the known outer bounds and show that the outer bound presented is at least as tight as the existing bounds.

Information Theory · Computer Science 2008-07-24 Chandra Nair

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

This study investigates the capacity region of a three-user cognitive radio network with two primary users and one cognitive user. A three-user Cognitive Interference Channel (C-IFC) is proposed by considering a three-user Interference…

Information Theory · Computer Science 2012-06-20 Mahtab Mirmohseni , Bahareh Akhbari , Mohammad Reza Aref

Outer bounds on the admissible source region for broadcast channels with dependent sources are developed and used to prove capacity results for several classes of sources and channels.

Information Theory · Computer Science 2009-02-16 Gerhard Kramer , Yingbin Liang , Shlomo Shamai

We characterize the capacity region of noiseless X-Channels with intermittent connectivity and delayed channel state information at the transmitters. We consider the general case in which each transmitter has a common message for both…

Information Theory · Computer Science 2025-02-05 Alireza Vahid

We study the discrete memoryless Z-interference channel (ZIC) where the transmitter of the pair that suffers from interference is cognitive. We first provide upper and lower bounds on the capacity of this channel. We then show that, when…

Information Theory · Computer Science 2008-12-04 Nan Liu , Ivana Maric , Andrea Goldsmith , Shlomo Shamai

The paper establishes the capacity region of the Gaussian interference channel with many transmitter-receiver pairs constrained to use point-to-point codes. The capacity region is shown to be strictly larger in general than the achievable…

Information Theory · Computer Science 2011-02-15 Francois Baccelli , Abbas El Gamal , David Tse

The interference channel with common information (IC-CI) consists of two transmit-receive pairs that communicate over a common noisy medium. Each transmitter has an individual message for its paired receiver, and additionally, both…

Information Theory · Computer Science 2012-03-01 Chinmay S. Vaze , Mahesh K. Varanasi

In these series of multi-part papers, a systematic study of fundamental limits of communications in interference networks is established. Here, interference network is referred to as a general single-hop communication scenario with…

Information Theory · Computer Science 2013-02-18 Reza K. Farsani

In this paper, we present a general formula for the capacity region of a general interference channel with two pairs of users. The formula shows that the capacity region is the union of a family of rectangles, where each rectangle is…

Information Theory · Computer Science 2013-10-08 Xiao Ma , Lei Lin , Chulong Liang , Xiujie Huang , Baoming Bai

Achievable rate regions and outer bounds are derived for three-user interference channels where the transmitters cooperate in a unidirectional manner via a noncausal message-sharing mechanism. The three-user channel facilitates different…

Information Theory · Computer Science 2016-11-17 K. G. Nagananda , Parthajit Mohapatra , Chandra R. Murthy , Shalinee Kishore

A two-user Gaussian Z-Interference Channel (GZIC) is considered, in which encoders are connected through noiseless links with finite capacities. In this setting, prior to each transmission block the encoders communicate with each other over…

Information Theory · Computer Science 2010-05-28 Hossein Bagheri , Abolfazl S. Motahari , Amir K. Khandani