English
Related papers

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

200 papers

This paper presents the achievable rate region frontiers for the n-user interference channel when there is no cooperation at the transmit nor at the receive side. The receiver is assumed to treat the interference as additive thermal noise…

Information Theory · Computer Science 2010-08-23 Mohamad Charafeddine , Aydin Sezgin , Arogyaswami Paulraj

In this paper, we first study a two-user interference channel with generalized feedback. We establish an inner bound on its capacity region. The coding scheme that we employ for the inner bound is based on an appropriate combination of…

Information Theory · Computer Science 2016-11-15 Abdellatif Zaidi

The sum secure degrees of freedom (s.d.o.f.) of two fundamental multi-user network structures, the K-user Gaussian multiple access (MAC) wiretap channel and the K-user interference channel (IC) with secrecy constraints, have been determined…

Information Theory · Computer Science 2016-11-17 Jianwei Xie , Sennur Ulukus

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

The degrees-of-freedom of a K-user Gaussian interference channel (GIFC) has been defined to be the multiple of (1/2)log_2(P) at which the maximum sum of achievable rates grows with increasing P. In this paper, we establish that the…

Information Theory · Computer Science 2009-01-14 Raul Etkin , Erik Ordentlich

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

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

This paper studies the capacity region of a $K$-user cyclic Gaussian interference channel, where the $k$th user interferes with only the $(k-1)$th user (mod $K$) in the network. Inspired by the work of Etkin, Tse and Wang, which derived a…

Information Theory · Computer Science 2012-05-22 Lei Zhou , Wei Yu

The fully connected K-user interference channel is studied in a multipath environment with bandwidth W. We show that when each link consists of D physical paths, the total spectral efficiency can grow {\it linearly} with K. This result…

Information Theory · Computer Science 2008-09-19 Leonard Grokop , David N. C. Tse , Roy D. Yates

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

How to manage the interference introduced by the enormous wireless devices is a crucial issue to address in the prospective sixth-generation (6G) communications. The treating interference as noise (TIN) optimality conditions are commonly…

Information Theory · Computer Science 2022-02-16 Shuaifei Chen , Jiayi Zhang , Zheng Chen , Bo Ai

An achievable rate region, based on lattice interference alignment, is derived for a class of time-invariant Gaussian interference channels with more than two users. The result is established via a new coding theorem for the two-user…

Information Theory · Computer Science 2011-06-21 Or Ordentlich , Uri Erez

In this paper, we study the degrees of freedom (DoF) region and sum DoF of the time-selective $K$-user interference channel in the presence of intelligent reflecting surfaces (IRSs). We consider four types of IRSs, namely 1) active IRSs,…

Information Theory · Computer Science 2021-11-05 Ali H. Abdollahi Bafghi , Vahid Jamali , Masoumeh Nasiri-Kenari , Robert Schober

We study the generalized degrees of freedom (gDoF) of block-fading noncoherent multiple input multiple output (MIMO) channels with asymmetric distributions of link strengths and a coherence time of T symbol durations. We derive the optimal…

Information Theory · Computer Science 2019-11-19 Joyson Sebastian , Suhas. N. Diggavi

We study the degrees of freedom (DoF) regions of two-user multiple-input multiple-output (MIMO) Z and full interference channels in this paper. We assume that the receivers always have perfect channel state information. We first derive the…

Information Theory · Computer Science 2010-11-10 Lei Ke , Zhengdao Wang

In this paper, the available spatial Degrees-Of-Freedoms (DOF) in single antenna systems is exploited. A new coding scheme is proposed in which several data streams having fractional multiplexing gains are sent by transmitters and…

Information Theory · Computer Science 2016-11-18 Abolfazl Seyed Motahari , Shahab Oveis Gharan , Mohammad-Ali Maddah-Ali , Amir Keyvan Khandani

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

The generalized degrees of freedom (GDoF) of the two user symmetric multiple input multiple output (MIMO) interference channel (IC) are characterized as a function of the channel strength levels and the level of channel state information at…

Information Theory · Computer Science 2017-05-03 Arash Gholami Davoodi , Syed A. Jafar

We consider secure communication over a two-user Gaussian interference channel, where each transmitter sends a confidential message to its legitimate receiver. For this setting, we identify a regime where the simple scheme of using Gaussian…

Information Theory · Computer Science 2017-06-21 Jinyuan Chen

This paper considers the K user cognitive interference channel with one primary and K-1 secondary/cognitive transmitters with a cumulative message sharing structure, i.e cognitive transmitter $i\in [2:K]$ knows non-causally all messages of…

Information Theory · Computer Science 2013-01-29 Diana Maamari , Daniela Tuninetti , Natasha Devroye
‹ Prev 1 3 4 5 6 7 10 Next ›