English
Related papers

Related papers: Interference Alignment for Line-of-Sight Channels

200 papers

We study a fundamental problem called Minimum Length Link Scheduling (MLLS) which is crucial to the efficient operations of wireless networks. Given a set of communication links of arbitrary length spread and assume each link has one unit…

Networking and Internet Architecture · Computer Science 2012-08-06 Xiaohua Xu , Jiannong Cao , Xiang-Yang Li

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 propose new ergodic interference alignment techniques for $K$-user interference channels with delayed feedback. Two delayed feedback scenarios are considered -- delayed channel information at transmitter (CIT) and delayed output…

Information Theory · Computer Science 2013-03-14 Myung Gil Kang , Wan Choi

This paper considers large random wireless networks where transmit-and-receive node pairs communicate within a certain range while sharing a common spectrum. By modeling the spatial locations of nodes based on stochastic geometry,…

Information Theory · Computer Science 2014-10-29 Namyoon Lee , Francois Baccelli , Robert W. Heath

The K-user cyclic Z-interference channel models a situation in which the kth transmitter causes interference only to the (k-1)th receiver in a cyclic manner, e.g., the first transmitter causes interference only to the Kth receiver. The…

Information Theory · Computer Science 2016-11-17 Ravi Tandon , Soheil Mohajer , H. Vincent Poor

We study the capacity of discrete memoryless many-to-one interference channels, i.e., K user interference channels where only one receiver faces interference. For a class of many-to-one interference channels, we identify a noisy…

Information Theory · Computer Science 2009-12-17 Viveck R. Cadambe , Syed A. Jafar

We investigate the $K$-user many-to-one interference channel with confidential messages in which the $K$th user experiences interference from all other $K-1$ users, and is at the same time treated as an eavesdropper to all the messages of…

Information Theory · Computer Science 2009-05-19 Xiang He , Aylin Yener

In this paper, we study the achievable degrees-of-freedom (DoF) regions of the $K$-user multiple-input-single-output (MISO) time correlated broadcast channel (BC). The time correlation induces knowledge of the current channel state…

Information Theory · Computer Science 2014-12-03 Yi Luo , Tharmalingam Ratnarajah , Anastasios K. Papazafeiropoulos

We consider settings in which T multi-antenna transmitters and K single-antenna receivers concurrently utilize the available communication resources. Each transmitter sends useful information only to its intended receivers and can degrade…

Information Theory · Computer Science 2015-10-28 Rami Mochaourab , Eduard Jorswieck

We consider the $K$-cell multiple-input multiple-output (MIMO) interfering multiple-access channel (IMAC) with time-invariant channel coefficients, where each cell consists of a base station (BS) with $M$ antennas and $N$ users having $L$…

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

The N+1 user, 1 x N single input multiple output (SIMO) Gaussian interference channel where each transmitter has a single antenna and each receiver has N antennas is studied. The symmetric capacity within O(1) is characterized for the…

Information Theory · Computer Science 2009-05-13 Tiangao Gou , Syed A. Jafar

We consider the problem of allocating radio channels to links in a wireless network. Links interact through interference, modelled as a conflict graph (i.e., two interfering links cannot be simultaneously active on the same channel). We aim…

Machine Learning · Computer Science 2015-02-18 Marc Lelarge , Alexandre Proutiere , M. Sadegh Talebi

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

In this article, we investigate the real-world capability of the multi-link operation (MLO) framework -- one of the key MAC-layer features included in the IEEE 802.11be amendment -- by using a large dataset containing 5 GHz spectrum…

Networking and Internet Architecture · Computer Science 2023-05-04 Marc Carrascosa , Giovanni Geraci , Edward Knightly , Boris Bellalta

The K-user symmetric multiple input multiple output (MIMO) Gaussian interference channel (IC) where each transmitter has M antennas and each receiver has N antennas is studied from a generalized degrees of freedom (GDOF) perspective. An…

Information Theory · Computer Science 2012-08-10 Parthajit Mohapatra , Chandra R. Murthy

We consider the multiplexing gain (MUXG) of the fully connected K-user line-of-sight (LOS) interference channels (ICs). A polarimetric antenna composed of 3 orthogonal electric dipoles and 3 orthogonal magnetic dipoles is considered where…

Information Theory · Computer Science 2009-10-15 Sung ho Chae , Sang Won Choi , Sae-Young Chung

The sum secure degrees of freedom (s.d.o.f.) of two fundamental multi-user network structures, the K-user Gaussian multiple access (MAC) wiretap channel and the K-user interference channel (IC) with secrecy constraints, have been determined…

Information Theory · Computer Science 2016-11-17 Jianwei Xie , Sennur Ulukus

An efficient interference alignment (IA) scheme is developed for $K$-user single-input single-output frequency selective fading interference channels. The main idea is to steer the transmit beamforming matrices such that at each receiver…

Information Theory · Computer Science 2009-06-23 Sang Won Choi , Syed A. Jafar , Sae-Young Chung

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

An open question posed by Fawzi and Ferme [Transactions on Information Theory 2024], asks whether non-signaling (NS) assistance can increase the capacity of a broadcast channel (BC). We answer this question in the affirmative, by showing…

Information Theory · Computer Science 2026-02-12 Yuhang Yao , Syed A. Jafar
‹ Prev 1 8 9 10 Next ›