English
Related papers

Related papers: Explicit and almost sure conditions for K/2 degree…

200 papers

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

Stotz et al., 2016, reported a sufficient (injectivity) condition for each user in a K-user single-antenna constant interference channel to achieve 1/2 degree of freedom. The present paper proves that this condition is necessary as well and…

Information Theory · Computer Science 2018-05-09 Recep Gül , Helmut Bölcskei , Shlomo Shamai

We establish a formal connection between the problem of characterizing degrees of freedom (DoF) in constant single-antenna interference channels (ICs), with general channel matrix, and the field of additive combinatorics. The theory we…

Information Theory · Computer Science 2015-06-08 David Stotz , Helmut Bölcskei

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 derive the DoF…

Information Theory · Computer Science 2010-03-23 Lei Ke , Zhengdao Wang

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

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

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

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

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

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 study the degrees of freedom (DoF) of the frequency-selective K-user interference channel in the presence of an instantaneous relay (IR) with multiple receive and transmit antennas. We investigate two scenarios based on…

Information Theory · Computer Science 2021-09-21 Ali H. Abdollahi Bafghi , Mahtab Mirmohseni , Masoumeh Nasiri-Kenari

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

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

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 work is to study the degrees of freedom (DoF) for the $K$-user MIMO Y channel. Previously, two transmission frameworks have been proposed for the DoF analysis when $N \geq 2M$, where $M$ and $N$ denote the number of antennas at each…

Information Theory · Computer Science 2018-02-21 Kangqi Liu , Meixia Tao

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

We characterize the total degrees of freedom (DoF) of the full-rank MIMO X channel with arbitrary number of antennas at each node. We elucidate that the existing outer bound is tight for any antenna configuration and provide transmit and…

Information Theory · Computer Science 2012-10-10 Adrian Agustin , Josep Vidal

We provide the degrees of freedom (DoF) characterization for the $3$-user $M_T\times M_R$ multiple-input multiple-output (MIMO) interference channel (IC) with \emph{rank-deficient} channel matrices, where each transmitter is equipped with…

Information Theory · Computer Science 2016-11-17 Yong Zeng , Xiaoli Xu , Yong Liang Guan , Erry Gunawan , Chenwei 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
‹ Prev 1 2 3 10 Next ›