English
Related papers

Related papers: (n,K)-user Interference Channels: Degrees of Freed…

200 papers

This paper considers a K-user Multiple-Input-Single-Output (MISO) Interference Channel (IC), where the channel state information obtained by the transmitters (CSIT) is perfect, but completely outdated. A Retrospective Interference Alignment…

Information Theory · Computer Science 2015-02-26 Chenxi Hao , Bruno Clerckx

In this paper, we consider the problem of the interference alignment for the $K$-user SISO interference channel with blind channel state information at transmitters (CSIT). Our achievement in contrast to popular $K-$user interference…

Information Theory · Computer Science 2016-02-11 Milad Johnny , Mohammad Reza Aref

Classical multiuser information theory studies the fundamental limits of models with a fixed (often small) number of users as the coding blocklength goes to infinity. This work proposes a new paradigm, referred to as many-user information…

Information Theory · Computer Science 2014-05-06 Xu Chen , Dongning Guo

There has been major progress over the last decade in understanding the classical interference channel (IC). Recent key results show that constant bit gap capacity results can be obtained from linear deterministic models (LDMs). However, it…

Information Theory · Computer Science 2016-11-17 Rick Fritschek , Gerhard Wunder

We consider symmetric two-user Gaussian interference channel with common messages. We derive an upper bound on the sum capacity, and show that the upper bound is tight in the low interference regime, where the optimal transmission scheme is…

Information Theory · Computer Science 2014-01-22 Quan Geng , Tie Liu

In a K-user Gaussian interference channel, it has been shown that if for each user the desired signal strength is no less than the sum of the strengths of the strongest interference from this user and the strongest interference to this user…

Information Theory · Computer Science 2014-01-14 Chunhua Geng , Hua Sun , Syed A. Jafar

We investigate the secure degrees of freedom (SDoF) of the wiretap and the K user Gaussian broadcast channels with multiple antennas at the transmitter, the legitimate receivers and an unknown number of eavesdroppers each with a number of…

Information Theory · Computer Science 2016-04-01 Mohamed Amir , Tamer Khattab , Tarek Elfouly , Amr Mohamed

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 this work, we consider the use of interference alignment (IA) in a MIMO interference channel (IC) under the assumption that each transmitter (TX) has access to channel state information (CSI) that generally differs from that available to…

Information Theory · Computer Science 2013-05-08 Paul de Kerret , Maxime Guillaud , David Gesbert

In this paper, a multiple antenna wire-tap channel in the presence of a multi-antenna cooperative jammer is studied. In particular, the secure degrees of freedom (s.d.o.f.) of this channel is established, with $N_t$ antennas at the…

Information Theory · Computer Science 2015-12-24 Mohamed Nafea , Aylin Yener

This paper provides a survey of the state-of-the-art information theoretic analysis for overlay multi-user (more than two pairs) cognitive networks and reports new capacity results. In an overlay scenario, cognitive / secondary users share…

Information Theory · Computer Science 2015-10-26 Diana Maamari , Daniela Tuninetti , Natasha Devroye

We explore 5 network communication problems where the possibility of interference alignment, and consequently the total number of degrees of freedom (DoF) with channel uncertainty at the transmitters are unknown. These problems share the…

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

In this paper, we study the state-dependent two-user interference channel, where the state information is non-causally known at both transmitters but unknown to either of the receivers. We first propose two coding schemes for the discrete…

Information Theory · Computer Science 2015-03-19 Lili Zhang , Jinhua Jiang , Shuguang Cui

We consider a homogeneous multiple cellular scenario with multiple users per cell, i.e., $K\geq 1$ where $K$ denotes the number of users in a cell. In this scenario, a degrees of freedom outer bound as well as an achievable scheme that…

Information Theory · Computer Science 2011-08-09 Taejoon Kim , David J. Love , Bruno Clerckx , Duckdong Hwang

We study deterministic approximations of the Gaussian two-user multiple access wiretap channel (G-MAC-WT) and the Gaussian wiretap channel with a helper (G-WT-H). These approximations enable results beyond the recently shown 2/3 and 1/2…

Information Theory · Computer Science 2018-04-24 Rick Fritschek , Gerhard Wunder

Sufficient conditions required to achieve the interference-free capacity region of ergodic fading K-user interference channels (IFCs) are obtained. In particular, this capacity region is shown to be achieved when every receiver decodes all…

Information Theory · Computer Science 2009-10-27 Lalitha Sankar , Jan Vondrak , H. Vincent Poor

We consider a secure communication scenario through the two-user Gaussian interference channel: each transmitter (user) has a confidential message to send reliably to its intended receiver while keeping it secret from the other receiver.…

Information Theory · Computer Science 2016-04-26 Parisa Babaheidarian , Somayeh Salimi , Panos Papadimitratos

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 introduce the two-way Gaussian interference channel in which there are four nodes with four independent messages: two-messages to be transmitted over a Gaussian interference channel in the $\rightarrow$ direction, simultaneously with…

Information Theory · Computer Science 2012-10-09 Zhiyu Cheng , Natasha Devroye

In this paper, we propose low complexity opportunistic methods for interference alignment in $K$-transmitter MIMO interference channels by exploiting multiuser diversity. We do not assume availability of channel state information (CSI) at…

Information Theory · Computer Science 2015-09-30 Atul Kumar Sinha , A. K. Chaturvedi