English
Related papers

Related papers: On the Optimality of Treating Interference as Nois…

200 papers

We investigate the total degrees of freedom (DoF) of the K-user rank-deficient interference channel with feedback. For the two-user case, we characterize the total DoF by developing an achievable scheme and deriving a matching upper bound.…

Information Theory · Computer Science 2016-11-17 Sung Ho Chae , Changho Suh , Sae-Young Chung

The sum-rate capacity of the parallel Gaussian interference channel is shown to be achieved by independent transmission across sub-channels and treating interference as noise in each sub-channel if the channel coefficients and power…

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

While interference alignment schemes have been employed to realize the full multiplexing gain of $K$-user interference channels, the analyses performed so far have predominantly focused on the case when global channel knowledge is available…

Information Theory · Computer Science 2009-12-01 Rajesh T Krishnamachari , Mahesh K Varanasi

We consider a dense $K$ user Gaussian interference network formed by paired transmitters and receivers placed independently at random in a fixed spatial region. Under natural conditions on the node position distributions and signal…

Information Theory · Computer Science 2011-09-12 Oliver Johnson , Matthew Aldridge , Robert Piechocki

The degrees of freedom (DoF) number of the fully connected K-user Gaussian interference channel is known to be K/2. In [1], the DoF for the same channel model was studied while allowing each message to be available at its own transmitter as…

Information Theory · Computer Science 2012-02-29 Aly El Gamal , V. Sreekanth Annapureddy , Venugopal V. Veeravalli

A general time-varying feedback coding scheme is proposed for $M$-user fully connected symmetric Gaussian interference channels. Based on the analysis of the general coding scheme, we prove a theorem which gives a criterion for designing…

Information Theory · Computer Science 2019-10-01 Lan V. Truong , Hirosuke Yamamoto

Using ideas from Generalized Degrees of Freedom (GDoF) analyses and extremal network theory, this work studies the extremal gain of optimal power control over binary (on/off) power control, especially in large interference networks, in…

Information Theory · Computer Science 2022-05-09 Yao-Chia Chan , Pouya Pezeshkpour , Chunhua Geng , Syed A. Jafar

Gaussian MIMO channel under total transmit and interference power constraints (TPC and IPC) is considered. A closed-form solution for the optimal transmit covariance matrix in the general case is obtained using the KKT-based approach (up to…

Information Theory · Computer Science 2020-02-20 Sergey Loyka

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

In this paper we explore the information-theoretic aspects of interference alignment and its relation to channel state information (CSI). For the $K-$user interference channel using different changing patterns between different users, we…

Information Theory · Computer Science 2015-12-08 Milad Johnny , Mohammad Reza Aref

Recent investigations have shown sum capacity results within a constant bit-gap for several channel models, e.g. the two-user Gaussian interference channel (G-IC), k-user G-IC or the Gaussian X-channel. This has motivated investigations of…

Information Theory · Computer Science 2017-05-15 Rick Fritschek , Gerhard Wunder

The interference relay channel (IRC) under strong interference is considered. A high-signal-to-noise ratio (SNR) generalized degrees of freedom (GDoF) characterization of the capacity is obtained. To this end, a new GDoF upper bound is…

Information Theory · Computer Science 2013-10-07 Soheyl Gherekhloo , Anas Chaaban , Aydin Sezgin

Consider a K-user flat fading MIMO interference channel where the k-th transmitter (or receiver) is equipped with M_k (respectively N_k) antennas. If a large number of statistically independent channel extensions are allowed either across…

Information Theory · Computer Science 2015-05-27 Meisam Razaviyayn , Gennady Lyubeznik , Zhi-Quan Luo

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

This paper studies the achievable rates of Gaussian interference channels with additive white Gaussian noise (AWGN), when improper or circularly asymmetric complex Gaussian signaling is applied. For the Gaussian multiple-input…

Information Theory · Computer Science 2016-11-18 Yong Zeng , Cenk M. Yetis , Erry Gunawan , Yong Liang Guan , Rui Zhang

In this paper, the $K$-user interference channel with secrecy constraints is considered with delayed channel state information at transmitters (CSIT). We propose a novel secure retrospective interference alignment scheme in which the…

Information Theory · Computer Science 2020-01-08 Mohamed Seif , Ravi Tandon , Ming Li

We study a two-user cognitive interference channel (CIC) where one of the transmitters (primary) has knowledge of a linear combination (over an appropriate finite field) of the two information messages. We refer to this channel model as…

Information Theory · Computer Science 2013-01-29 Song-Nam Hong , Giuseppe Caire

The aim of this paper is to study the achievable rates for a $K$ user Gaussian interference channels for any SNR using a combination of lattice and algebraic codes. Lattice codes are first used to transform the Gaussian interference channel…

Information Theory · Computer Science 2011-09-27 Amin Jafarian , Sriram Vishwanath

Multi-user Gaussian MIMO wiretap channel is considered under interference power constraints (IPC), in addition to the total transmit power constraint (TPC). Algorithms for \textit{global} maximization of its secrecy rate are proposed. Their…

Information Theory · Computer Science 2020-12-02 Limeng Dong , Sergey Loyka , Yong Li

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