English
Related papers

Related papers: Interference Channels with Destination Cooperation

200 papers

A recent result of the authors shows a so-called I-MMSE-like relationship that, for the two-user Gaussian interference channel, an I-MMSE relationship holds in the limit, as n $\to \infty$, between the interference and the interfered-with…

Information Theory · Computer Science 2018-04-17 Ronit Bustin , H. Vincent Poor , Shlomo Shamai

This paper studies the two-user Gaussian interference channel with half-duplex causal cognition. This channel model consists of two source-destination pairs sharing a common wireless channel. One of the sources, referred to as the…

Information Theory · Computer Science 2016-11-15 Martina Cardone , Daniela Tuninetti , Raymond Knopp , Umer Salim

This work considers coordination and bargaining between two selfish users over a Gaussian interference channel using game theory. The usual information theoretic approach assumes full cooperation among users for codebook and rate selection.…

Information Theory · Computer Science 2016-11-17 Xi Liu , Elza Erkip

In this work, we derive achievable rate regions for the three-user interference channels with asymmetric transmitter cooperation and various decoding capabilities at the receivers. The three-user channel facilitates different ways of…

Information Theory · Computer Science 2011-02-23 K. G. Nagananda , Chandra R. Murthy

In this paper, we use the linear deterministic approximation model to study a two user multiple access channel mutually interfering with a point to point link, which represents a basic setup of a cellular system. We derive outer bounds on…

Information Theory · Computer Science 2011-05-12 Jörg Bühler , Gerhard Wunder

The goal of this paper is to provide a rigorous information-theoretic analysis of subnetworks of interference networks. We prove two coding theorems for the compound multiple-access channel with an arbitrary number of channel states. The…

Information Theory · Computer Science 2011-02-02 Moritz Wiese , Holger Boche , Igor Bjelaković , Volker Jungnickel

This paper studies the capacity of a class of discrete memoryless interference channels where interference is defined analogous to that of Gaussian interference channel with one-sided weak interference. The sum-rate capacity of this class…

Information Theory · Computer Science 2013-03-11 Fangfang Zhu , Biao Chen

This paper addresses an interference channel consisting of $\mathbf{n}$ active users sharing $u$ frequency sub-bands. Users are asynchronous meaning there exists a mutual delay between their transmitted codes. A stationary model for…

Information Theory · Computer Science 2010-06-17 Kamyar Moshksar , Amir K. Khandani

Using Gaussian inputs and treating interference as noise at the receivers has recently been shown to be sum capacity achieving for the two-user single-input single-output (SISO) Gaussian interference channel in a low interference regime,…

Information Theory · Computer Science 2010-10-25 V. Sreekanth Annapureddy , Venugopal V. Veeravalli

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

A deep understanding of the queuing performance of wireless networks is essential for the advancement of future wireless communications. The stochastic nature of wireless channels in general gives rise to a time varying transmission rate.…

Networking and Internet Architecture · Computer Science 2016-04-05 Sebastian Schiessl , Farshad Naghibi , Hussein Al-Zubaidy , Markus Fidler , James Gross

This paper is concerned with general interference channels characterized by a sequence of transition (conditional) probabilities. We present a general formula for the capacity region of the interference channel with two pairs of users. The…

Information Theory · Computer Science 2012-02-03 Lei Lin , Xiao Ma , Xiujie Huang , Baoming Bai

We consider a cooperative Gaussian interference channel in which each receiver must decode its intended message locally, with the help of cooperation either at the receivers side or at the transmitter side. In the case of receiver…

Information Theory · Computer Science 2015-10-07 Vasilis Ntranos , Mohammad Ali Maddah-Ali , Giuseppe Caire

We investigate the $K$-user many-to-one interference channel with confidential messages in which the $K$th user experiences interference from all other $K-1$ users, and is at the same time treated as an eavesdropper to all the messages of…

Information Theory · Computer Science 2009-05-19 Xiang He , Aylin Yener

We obtain new sum capacity results for the Gaussian many-to-one and one-to-many interference channels in channel parameter regimes where the sum capacity was known only up to a constant gap. Simple Han-Kobayashi (HK) schemes, i.e., HK…

Information Theory · Computer Science 2017-05-04 Abhiram Gnanasambandam , Ragini Chaluvadi , Srikrishna Bhashyam

Calculating the capacity of interference channels is a notorious open problem in classical information theory. Such channels have two senders and two receivers, and each sender would like to communicate with a partner receiver. The capacity…

Quantum Physics · Physics 2012-05-28 Omar Fawzi , Patrick Hayden , Ivan Savov , Pranab Sen , Mark M. Wilde

In this paper, we study the state-dependent two-user interference channel, where the state information is non-causally known at both transmitters but unknown to either of the receivers. We first propose two coding schemes for the discrete…

Information Theory · Computer Science 2015-03-19 Lili Zhang , Jinhua Jiang , Shuguang Cui

In this paper, we consider a Gaussian multiple access channel with multiple independent additive white Gaussian interferences. Each interference is known to exactly one transmitter non-causally. The capacity region is characterized to…

Information Theory · Computer Science 2011-02-25 I-Hsiang Wang

This paper explores the two-user Gaussian interference channel through the lens of a natural deterministic channel model. The main result is that the deterministic channel uniformly approximates the Gaussian channel, the capacity regions…

Information Theory · Computer Science 2008-07-22 Guy Bresler , David Tse

The capacity of a network in which a multiple access channel (MAC) generates interference to a single-user channel is studied. An achievable rate region based on superposition coding and joint decoding is established for the discrete case.…

Information Theory · Computer Science 2012-09-06 Fangfang Zhu , Xiaohu Shang , Biao Chen , H. Vincent Poor