English
Related papers

Related papers: Topological Interference Management with Alternati…

200 papers

In this paper, the 3-user multiple-input multiple-output Gaussian interference channel with M antennas at each transmitter and N antennas at each receiver is considered. It is assumed that the channel coefficients are constant and known to…

Information Theory · Computer Science 2011-05-23 Mohamed Amir , Amr El-Keyi , Mohammed Nafie

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

This work studies linear interference networks, both wired and wireless, with no channel state information at the transmitters (CSIT) except a coarse knowledge of the end-to-end one-hop topology of the network that only allows a distinction…

Information Theory · Computer Science 2016-11-17 Syed A. Jafar

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

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 work, we study the value of cooperative transmission in wireless networks if no channel state information is available at the transmitters (no CSIT). Our focus is on large locally connected networks, where each transmitter is…

Information Theory · Computer Science 2017-02-07 Aly El Gamal

In this paper, we propose opportunistic interference alignment (OIA) schemes for three-transmitter multiple-input multiple-output (MIMO) interference channels (ICs). In the proposed OIA, each transmitter has its own user group and selects a…

Information Theory · Computer Science 2015-03-19 Jung Hoon Lee , Wan Choi

Interference alignment allows multiple users to share the same frequency and time resource in a wireless communications system. At present, two performance bounds, in terms of degree of freedom, have been proposed. One is for…

Information Theory · Computer Science 2015-11-02 Feng Ouyang

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

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

In this paper, we study a communication system consisting of three end-nodes, e.g. a single transceiver base station (BS), one transmitting and one receiving user equipments (UEs), and a common two-way relay node (RN) wherein the…

Information Theory · Computer Science 2011-02-16 Erhan Yilmaz , Raymond Knopp , David Gesbert

Achievable rate regions and outer bounds are derived for three-user interference channels where the transmitters cooperate in a unidirectional manner via a noncausal message-sharing mechanism. The three-user channel facilitates different…

Information Theory · Computer Science 2016-11-17 K. G. Nagananda , Parthajit Mohapatra , Chandra R. Murthy , Shalinee Kishore

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

We explore the degrees of freedom (DoF) of three classes of finite state compound wireless networks in this paper. First, we study the multiple-input single-output (MISO) finite state compound broadcast channel (BC) with arbitrary number of…

Information Theory · Computer Science 2009-09-24 Tiangao Gou , Syed A. Jafar , Chenwei Wang

This third part of the paper is related to the study of information flow in networks with strong interference. First, the two-receiver networks are considered. A unified outer bound for the capacity region of these networks is established.…

Information Theory · Computer Science 2013-02-18 Reza K. Farsani

In this paper, the 3-user Gaussian MIMO interference channel is considered. The asymmetric distribution of the DoF, where different users have different number of DoF, is studied. Two cases are presented, the first is when all transmitters…

Information Theory · Computer Science 2014-07-14 Mohamed Khalil , Tamer Khattab , Amr El-Keyi , Mohammed Nafie

The characterization of fundamental performance bounds of many-to-many communication systems in which participating nodes are active in an intermittent way is one of the major challenges in communication theory. In order to address this…

Information Theory · Computer Science 2019-06-03 Joachim Neu , Anas Chaaban , Aydin Sezgin , Mohamed-Slim Alouini

We study information theoretic models of interference networks that consist of K Base Station (BS) - Mobile Terminal (MT) pairs. Each BS is connected to the MT carrying the same index as well as L following MTs. We fix the value of L and…

Information Theory · Computer Science 2019-11-19 Manik Singhal , Tolunay Seyfi , Aly El Gamal

We consider the problem of cache-aided interference management in a network consisting of $K_{\mathrm{T}}$ single-antenna transmitters and $K_{\mathrm{R}}$ single-antenna receivers, where each node is equipped with a cache memory.…

Information Theory · Computer Science 2019-06-24 Enrico Piovano , Hamdi Joudeh , Bruno Clerckx

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