English
Related papers

Related papers: On Optimal Message Assignments for Interference Ch…

200 papers

The degrees of freedom (DoF) available for communication provides an analytically tractable way to characterize the information-theoretic capacity of interference channels. In this paper, the DoF of a K-user interference channel is studied…

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

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

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 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

In this paper, we characterize the degrees of freedom (DoF) for $K $-user $M \times 1 $ multiple-input single-output interference channels with reconfigurable antennas which have multiple preset modes at the receivers, assuming linear…

Information Theory · Computer Science 2016-02-15 Heecheol Yang , Wonjae Shin , Jungwoo Lee

In this paper, we explore the benefits, in the sense of total (sum rate) degrees of freedom (DOF), of cooperation and cognitive message sharing for a two-user multiple-input-multiple-output (MIMO) Gaussian interference channel with $M_1$,…

Information Theory · Computer Science 2008-03-13 Chiachi Huang , Syed A. Jafar

This paper studies the sum Degrees of Freedom (DoF) of $K$-user {\em asymmetric} MIMO Interference Channel (IC) with square direct link channel matrices, that is, the $u$-th transmitter and its intended receiver have $M_u\in\mathbb{N}$…

Information Theory · Computer Science 2014-10-21 Tang Liu , Daniela Tuninetti , Syed A. Jafar

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 consider a single hop interference network with $K$ transmitters and $J$ receivers, all having $M$ antennas. Each transmitter emits an independent message and each receiver requests an arbitrary subset of the messages. This generalizes…

Information Theory · Computer Science 2011-11-01 Lei Ke , Aditya Ramamoorthy , Zhengdao Wang , Huarui Yin

While the best known outerbound for the K user interference channel states that there cannot be more than K/2 degrees of freedom, it has been conjectured that in general the constant interference channel with any number of users has only…

Information Theory · Computer Science 2007-07-13 Viveck R. Cadambe , Syed A. Jafar

This paper investigates the achievable total degrees of freedom (DoF) of the MIMO multi-way relay channel that consists of K users, where each user is equipped with M antennas, and a decode-and-forward relay equipped with N antennas. In…

Information Theory · Computer Science 2016-11-15 Mohamed Salah , Amr El-Keyi , Yahya Mohasseb , Mohammed Nafie

This paper fully determines the degree-of-freedom (DoF) region of two-user interference channels with arbitrary number of transmit and receive antennas and isotropic fading, where the channel state information is available to the receivers…

Information Theory · Computer Science 2011-08-23 Yan Zhu , Dongning Guo

This paper studies the K-user Gaussian interference channel with secrecy constraints. Two distinct network models, namely the interference channel with confidential messages and the one with an external eavesdropper, are analyzed. Using…

Information Theory · Computer Science 2016-11-15 Onur Ozan Koyluoglu , Hesham El Gamal , Lifeng Lai , H. Vincent Poor

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

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

For a $K$-user interference channel with $M$ antenna at each transmitter and each receiver, the maximum total DoF of this channel has been previously determined to be $\max \sum_{k=1}^K d_k = MK/2$. However, the DoF region remains to be…

Information Theory · Computer Science 2010-11-17 Huarui Yin

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

Vector space interference alignment (IA) is known to achieve high degrees of freedom (DoF) with infinite independent channel extensions, but its performance is largely unknown for a finite number of possibly dependent channel extensions. In…

Information Theory · Computer Science 2016-11-17 Ruoyu Sun , Zhi-Quan Luo

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

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
‹ Prev 1 2 3 10 Next ›