English
Related papers

Related papers: Channel Diversity needed for Vector Space Interfer…

200 papers

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

Coordinated Multi-Point (CoMP) transmission is an infrastructural enhancement under consideration for next generation wireless networks. In this work, the capacity gain achieved through CoMP transmission is studied in various models of…

Information Theory · Computer Science 2013-10-10 Aly El Gamal , V. Sreekanth Annapureddy , Venugopal V. Veeravalli

Multiple-antenna broadcast channels with $M$ transmit antennas and $K$ single-antenna receivers is considered, where the channel of receiver $r$ takes one of the $J_r$ finite values. It is assumed that the channel states of each receiver…

Information Theory · Computer Science 2009-10-05 Mohammad Ali Maddah-Ali

This paper gives the approximate capacity region of a two-user MIMO interference channel with limited receiver cooperation, where the gap between the inner and outer bounds is in terms of the total number of receive antennas at the two…

Information Theory · Computer Science 2014-07-08 Mehdi Ashraphijuo , Vaneet Aggarwal , Xiaodong Wang

In this work, we consider achievable secrecy rates for symmetric $K$-user ($K \ge 3$) interference channels with confidential messages. We find that nested lattice codes and layered coding are useful in providing secrecy for these channels.…

Information Theory · Computer Science 2016-11-17 Xiang He , Aylin Yener

We study a multi-source Gaussian relay network consisting of $K$ source--destination pairs having $K$ unicast sessions. We assume $M$ layers of relays between the sources and the destinations. We find achievable degrees of freedom of the…

Information Theory · Computer Science 2009-10-20 Sang-Woon Jeon , Sae-Young Chung , Syed A. Jafar

This paper investigates how multiuser dimensions can effectively be exploited for target degrees of freedom (DoF) in interfering broadcast channels (IBC) consisting of K-transmitters and their user groups. First, each transmitter is assumed…

Information Theory · Computer Science 2013-10-28 Jung Hoon Lee , Wan Choi , Bhaskar D. Rao

We study the Degrees of Freedom (DoF) of the K-user interference channel with coordinated multi-point (CoMP) transmission and reception. Each message is jointly transmitted by M_t successive transmitters, and is jointly received by M_r…

Information Theory · Computer Science 2016-11-18 V. Sreekanth Annapureddy , Aly El Gamal , Venugopal V. Veeravalli

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

We explore the degrees of freedom of $M\times N$ user wireless $X$ networks, i.e. networks of $M$ transmitters and $N$ receivers where every transmitter has an independent message for every receiver. We derive a general outerbound on the…

Information Theory · Computer Science 2007-11-20 Viveck R. Cadambe , Syed A. Jafar

The symmetric K user interference channel with fully connected topology is considered, in which (a) each receiver suffers interference from all other (K-1) transmitters, and (b) each transmitter has causal and noiseless feedback from its…

Information Theory · Computer Science 2012-12-24 Soheil Mohajer , Ravi Tandon , H. Vincent Poor

Individual links in a wireless network may experience unequal fading coherence times due to differences in mobility or scattering environment, a practical scenario where the fundamental limits of communication have been mostly unknown. This…

Information Theory · Computer Science 2016-07-26 Mohamed Fadel , Aria Nosratinia

It has been conjectured by Host-Madsen and Nosratinia that complex Gaussian interference channels with constant channel coefficients have only one degree-of-freedom regardless of the number of users. While several examples are known of…

Information Theory · Computer Science 2012-04-03 Viveck R. Cadambe , Syed A. Jafar , Chenwei Wang

This paper studies vector space interference alignment for the three-user MIMO interference channel with no time or frequency diversity. The main result is a characterization of the feasibility of interference alignment in the symmetric…

Information Theory · Computer Science 2011-10-25 Guy Bresler , Dustin Cartwright , David Tse

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

This paper considers a $K$-cell multiple access channel with inter-symbol interference. The primary finding of this paper is that, without instantaneous channel state information at the transmitters (CSIT), the sum degrees-of-freedom (DoF)…

Information Theory · Computer Science 2017-04-11 Yo-Seb Jeon , Namyoon Lee , Ravi Tandon

In this paper, the degrees of freedom (DoF) regions of constant coefficient multiple antenna interference channels are investigated. First, we consider a $K$-user Gaussian interference channel with $M_k$ antennas at transmitter $k$, $1\le…

Information Theory · Computer Science 2014-02-18 Mahdi Zamanighomi , Zhengdao Wang

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 present a necessary and sufficient condition for $1/2$ degree of freedom for each user in constant $K$-user single-antenna interference channels. This condition applies to all channel topologies, i.e., to fully-connected channels as well…

Information Theory · Computer Science 2020-06-04 Recep Gül , David Stotz , Syed Ali Jafar , Helmut Bölcskei , Shlomo Shamai

Determining the feasibility conditions for vector space interference alignment in the K-user MIMO interference channel with constant channel coefficients has attracted much recent attention yet remains unsolved. The main result of this…

Information Theory · Computer Science 2011-06-02 Guy Bresler , Dustin Cartwright , David Tse