English
Related papers

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

200 papers

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 determine the exact sum secure degrees of freedom (d.o.f.) of the K-user Gaussian interference channel. We consider three different secrecy constraints: 1) K-user interference channel with one external eavesdropper (IC-EE), 2) K-user…

Information Theory · Computer Science 2013-05-31 Jianwei Xie , Sennur Ulukus

New sufficient conditions for a vector Gaussian interference channel to achieve the sum-rate capacity by treating interference as noise are derived, which generalize the existing results. More concise conditions for…

Information Theory · Computer Science 2016-11-17 Xiaohu Shang , H. Vincent Poor

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

The role of cooperation in managing interference - a fundamental feature of the wireless channel - is investigated by studying the two-user Gaussian interference channel where the source nodes can both transmit and receive in full-duplex.…

Information Theory · Computer Science 2011-01-28 Vinod M. Prabhakaran , Pramod Viswanath

The Gaussian $K$-user interference and $M\times K$ X channels are investigated with no instantaneous channel state information (CSI) at transmitters. First, it is assumed that the CSI is fed back to all nodes after a finite delay (delayed…

Information Theory · Computer Science 2016-11-17 Mohammad Javad Abdoli , Akbar Ghasemi , Amir Keyvan Khandani

This paper studies a symmetric K user Gaussian interference channel with K transmitters and K receivers. A "very strong" interference regime is derived for this channel setup. A "very strong" interference regime is one where the capacity…

Information Theory · Computer Science 2008-08-19 Sriram Sridharan , Amin Jafarian , Sriram Vishwanath , Syed A. Jafar

The many-to-one interference channel has received interest by virtue of embodying the essence of an interference network while being more tractable than the general K-user interference channel. In this paper, we introduce information…

Information Theory · Computer Science 2015-03-17 Xiang He , Aylin Yener

This paper studies the achievable rate region of the K-user Gaussian multiple-input single-output interference channel (MISO-IC) with the interference treated as noise, when improper or circularly asymmetric complex Gaussian signaling is…

Information Theory · Computer Science 2013-10-10 Yong Zeng , Rui Zhang , Erry Gunawan , Yong Liang Guan

The generalized degrees of freedom (GDoF) region of the multiple-input multiple-output (MIMO) Gaussian Z-interference channel with an arbitrary number of antennas at each node is established under the assumption of delayed channel state…

Information Theory · Computer Science 2016-05-04 Kaniska Mohanty , Mahesh K. Varanasi

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

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

In this paper, we investigate the generalized degrees-of-freedom (GDoF) of the asymmetric interference channel with delayed channel state information at the transmitter (CSIT), where each transmitter has two antennas, each receiver has one…

Information Theory · Computer Science 2022-05-04 Tong Zhang , Yufan Zhuang , Yinfei Xu

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

This letter is concerned with transmit and receive filter optimization for the K-user MIMO interference channel. Specifically, linear transmit and receive filter sets are designed which maximize the weighted sum rate while allowing each…

Information Theory · Computer Science 2012-01-04 Joonwoo Shin , Jaekyun Moon

This paper considers a Gaussian channel with one transmitter and two receivers. The goal is to maximize the communication rate at the intended/primary receiver subject to a disturbance constraint at the unintended/secondary receiver. The…

Information Theory · Computer Science 2016-03-25 Alex Dytso , Ronit Bustin , Daniela Tuninetti , Natasha Devroye , H. Vincent Poor , Shlomo Shamai

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 constant $K$-user Gaussian interference channel with $M$ antennas at each transmitter and $N$ antennas at each receiver, denoted as a $(K,M,N)$ channel. Relying on a result on simultaneous Diophantine approximation, a real…

Information Theory · Computer Science 2013-01-29 Mahdi Zamanighomi , Zhengdao Wang

We analyze the gains of opportunistic communication in multiuser interference channels. Consider a fully connected $n$-user Gaussian interference channel. At each time instance only $K\leq n$ transmitters are allowed to be communicating…

Information Theory · Computer Science 2010-07-22 Ali Tajer , Xiaodong Wang

This work proposes a novel outer bound for the Gaussian cognitive interference channel in strong interference at the primary receiver based on the capacity of a multi-antenna broadcast channel with degraded message set. It then shows that…

Information Theory · Computer Science 2015-03-19 Stefano Rini , Daniela Tuninetti , Natasha Devroye