English
Related papers

Related papers: Interference alignment-based sum capacity bounds f…

200 papers

The two user Gaussian interference channel with a full-duplex relay is studied. By using genie aided approaches, two new upper bounds on the achievable sum-rate in this setup are derived. These upper bounds are shown to be tighter than…

Information Theory · Computer Science 2010-08-16 Anas Chaaban , Aydin Sezgin

This paper studies distributed strategies for average-consensus of arbitrary vectors in the presence of network interference. We assume that the underlying communication on any \emph{link} suffers from \emph{additive interference} caused…

Systems and Control · Computer Science 2013-12-19 Usman A. Khan , Shuchin Aeron

In this paper, an interference network with arbitrary number of transmitters and receivers is studied, where each transmitter is equipped with a finite size cache. We obtain an information-theoretic lower bound on both the peak normalized…

Information Theory · Computer Science 2018-12-07 Antonious M. Girgis , Ozgur Ercetin , Mohammed Nafie , Tamer ElBatt

A constant K-user interference channel in which the users are not symbol-synchronous is considered. It is shown that the asynchronism among the users facilitates aligning interfering signals at each receiver node while it does not affect…

Information Theory · Computer Science 2015-03-17 Mehdi Torbatian , Hossein Najafi , Mohamed Oussama Damen

In this paper the cognitive interference channel with a common message, a variation of the classical cognitive interference channel in which the cognitive message is decoded at both receivers, is studied. For this channel model new outer…

Information Theory · Computer Science 2012-08-21 Stefano Rini , Carolin Huppert

In this paper, a class of relay networks is considered. We assume that, at a node, outgoing channels to its neighbors are orthogonal, while incoming signals from neighbors can interfere with each other. We are interested in the multicast…

Information Theory · Computer Science 2016-11-17 Wooseok Nam , Sae-Young Chung , Yong H. Lee

This paper considers the minimization of transmit power in Gaussian parallel interference channels, subject to a rate constraint for each user. To derive decentralized solutions that do not require any cooperation among the users, we…

Information Theory · Computer Science 2011-11-09 Jong-Shi Pang , Gesualdo Scutari , Francisco Facchinei , Chaoxiong Wang

We consider the $K$-user Multiple Input Multiple Output (MIMO) Gaussian interference channel with $M$ antennas at each transmitter and $N$ antennas at each receiver. It is assumed that channel coefficients are constant and are available at…

Information Theory · Computer Science 2016-11-15 Akbar Ghasemi , Abolfazl Seyed Motahari , Amir Keyvan Khandani

This paper adds to the understanding of the capacity region of the Gaussian interference channel. To this end, the capacity region of the one-sided Gaussian interference channel is first fully characterized. This is accomplished by…

Information Theory · Computer Science 2015-09-22 Mojtaba Vaezi , H. Vincent Poor

We consider the 3-user Gaussian interference channel and provide an outer bound on its capacity region. Under some conditions, which we call the mixed strong-very strong interference conditions, this outer bound is achievable. These…

Information Theory · Computer Science 2010-10-26 Anas Chaaban , Aydin Sezgin

In a K-user Gaussian interference channel, it has been shown by Geng et al. that if for each user the desired signal strength is no less than the sum of the strengths of the strongest interference from this user and the strongest…

Information Theory · Computer Science 2014-12-09 Chunhua Geng , Syed A. Jafar

This paper investigates the problem of distributed medium access control in a time slotted wireless multiple access network with an unknown finite number of homogeneous users. Assume that each user has a single transmission option. In each…

Information Theory · Computer Science 2018-11-28 Yanru Tang , Faeze Heydaryan , Jie Luo

This paper considers a two-user Gaussian interference channel with energy harvesting transmitters. Different than conventional battery powered wireless nodes, energy harvesting transmitters have to adapt transmission to availability of…

Information Theory · Computer Science 2015-03-19 Kaya Tutuncuoglu , Aylin Yener

In this paper, we consider the K-user interference channel with partial cooperation, where a strict subset of the K users cooperate. For the K-user interference channel with cooperating subsets of length M, the outer bound of the total…

Information Theory · Computer Science 2011-06-02 Ahmed A. Naguib , Khaled Elsayed , Mohammed Nafie

This paper studies a Gaussian Z-interference channel with a rate-limited digital relay link from one receiver to another. Achievable rate regions are derived based on a combination of Han-Kobayashi common-private information splitting…

Information Theory · Computer Science 2012-04-26 Lei Zhou , Wei Yu

We derive inner and outer bounds on the capacity region for a class of three-user partially connected interference channels. We focus on the impact of topology, interference alignment, and interplay between interference and noise. The…

Information Theory · Computer Science 2017-02-14 Muryong Kim , Yitao Chen , Sriram Vishwanath

We consider a two-user Gaussian multiple access channel with two independent additive white Gaussian interferences. Each interference is known to exactly one transmitter non-causally. Transmitters are allowed to cooperate through…

Information Theory · Computer Science 2010-09-23 I-Hsiang Wang

Interference alignment promises that, in Gaussian interference channels, each link can support half of a degree of freedom (DoF) per pair of transmit-receive antennas. However, in general, this result requires to precode the data bearing…

Information Theory · Computer Science 2014-02-14 Vasilis Ntranos , Mohammad Ali Maddah-Ali , Giuseppe Caire

The best outer bound on the capacity region of the two-user Gaussian Interference Channel (GIC) is known to be the intersection of regions of various bounds including genie-aided outer bounds, in which a genie provides noisy input signals…

Information Theory · Computer Science 2017-04-20 Junyoung Nam

An inner bound to the capacity region of a class of deterministic interference channels with three user pairs is presented. The key idea is to simultaneously decode the combined interference signal and the intended message at each receiver.…

Information Theory · Computer Science 2015-03-13 Bernd Bandemer , Abbas El Gamal