English
Related papers

Related papers: Rank Matching for Multihop Multiflow

200 papers

We show that the maximization of the sum degrees-of-freedom for the static flat-fading multiple-input multiple-output (MIMO) interference channel is equivalent to a rank constrained rank minimization problem (RCRM), when the signal spaces…

Information Theory · Computer Science 2015-03-17 Dimitris S. Papailiopoulos , Alexandros G. Dimakis

The two-user multiple-input multiple-output (MIMO) fast-fading interference channel (IC) with an arbitrary number of antennas at each of the four terminals is studied under the settings of Shannon feedback, limited Shannon feedback, and…

Information Theory · Computer Science 2011-11-01 Chinmay S. Vaze , Mahesh K. Varanasi

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

The \emph{degrees of freedom} (DoF) of the 3-user multiple-input multiple-output (MIMO) interference channel (IC) with full channel state information (CSI) and constant channel coefficients are characterized when linear filters are employed…

Information Theory · Computer Science 2014-08-01 Marc Torrellas , Adrian Agustin , Josep Vidal , Olga Muñoz

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

Achievable degrees-of-freedom (DoF) of the large-scale interfering two-way relay network is investigated. The network consists of $K$ pairs of communication nodes (CNs) and $N$ relay nodes (RNs). It is assumed that $K\ll N$ and each pair of…

Information Theory · Computer Science 2016-11-17 Hyun Jong Yang , Won-Yong Shin , Bang Chul Jung

In this paper, we study the degrees of freedom (DoF) of the symmetric multi-relay multiple-input multiple-output (MIMO) Y channel, where three user nodes, each with M antennas, communicate via K geographically separated relay nodes, each…

Information Theory · Computer Science 2018-08-21 Tian Ding , Xiaojun Yuan , Soung Chang Liew

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

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 optimal degrees of freedom (DoF) region for the two-pair MIMO two-way relay channel (TWRC) with asymmetric antenna setting, where two pairs of users exchange information with the help of a common relay. Each user…

Information Theory · Computer Science 2017-04-05 Kangqi Liu , Meixia Tao , Xiaojun Yuan

The question of whether the degrees of freedom (DoF) of multi-user networks can be enhanced even under isotropic fading and no channel state information (or output feedback) at the transmitters (CSIT) is investigated. Toward this end, the…

Information Theory · Computer Science 2012-09-07 Chinmay S. Vaze , Mahesh K. Varanasi

This paper investigates the degrees of freedom (DoF) of the L-cluster, K-user MIMO multi-way relay channel, where users in each cluster wish to exchange messages within the cluster, and they can only communicate through the relay. A novel…

Information Theory · Computer Science 2013-08-07 Ye Tian , Aylin Yener

In a $K$-pair-user two-way interference channel (TWIC), $2K$ messages and $2K$ transmitters/receivers form a $K$-user IC in the forward direction ($K$ messages) and another $K$-user IC in the backward direction which operate in full-duplex…

Information Theory · Computer Science 2013-11-28 Zhiyu Cheng , Natasha Devroye

We study in this paper a two-hop relaying network consisting of one source, one destination, and three amplify-and-forward (AF) relays operating in a half-duplex mode. In order to compensate for the inherent loss of capacity pre-log factor…

Information Theory · Computer Science 2012-07-17 Ki-Hong Park , Mohamed-Slim Alouini

This paper investigates the symmetric degrees of freedom (DoF) of MIMO cellular networks with G cells and K users per cell, having N antennas at each base station and M antennas at each user. In particular, we investigate achievability…

Information Theory · Computer Science 2013-12-11 Gokul Sridharan , Wei Yu

In this paper, we consider multiple-antenna $K$-user interference channels with backhaul collaboration in one side (among the transmitters or among the receivers) and investigate the trade-off between the rate in the channel versus the…

Information Theory · Computer Science 2018-07-24 Borna Kananian , Mohammad Ali Maddah-ali , Babak Hossein Khalaj

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

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 K-user flat fading MIMO interference channel with J instantaneous relays (KICJR) is considered. In the KICJR, the effective channel between sources and destinations including the relays has certain structure and is non-generic. For…

Information Theory · Computer Science 2015-08-17 Amin Azari , Farshad Lahouti , Tobias Weber

Interference alignment is known to achieve the maximum sum DoF of $\frac{4M}{3}$ in the $2 \times 2$ $X$-Network (i.e., two-transmitter (Tx) two-receiver (Rx) $X$-Network) with $M$ antennas at each node, as demonstrated by Jafar and Shamai.…

Information Theory · Computer Science 2013-09-11 Abhinav Ganesan , B. Sundar Rajan