English
Related papers

Related papers: Sum-set Inequalities from Aligned Image Sets: Inst…

200 papers

The simple scheme of treating interference as noise (TIN) is studied in this paper for the 3 x 2 X channel. A new sum-capacity upper bound is derived. This upper bound is transformed into a generalized degrees-of-freedom (GDoF) upper bound,…

Information Theory · Computer Science 2014-06-03 Soheil Gherekhloo , Anas Chaaban , Aydin Sezgin

In many communication channels, secrecy constraints usually incur a penalty in capacity, as well as generalized degrees-of-freedom (GDoF). In this work we show an interesting observation that, adding a helper can totally remove the penalty…

Information Theory · Computer Science 2018-12-04 Jinyuan Chen , Fan Li

We characterize the generalized degrees of freedom of the $K$ user symmetric Gaussian interference channel where all desired links have the same signal-to-noise ratio (SNR) and all undesired links carrying interference have the same…

Information Theory · Computer Science 2012-04-03 Syed A. Jafar , Sriram Vishwanath

This work analyses the Generalized Degrees-of-Freedom (GDoF) of the 2-User Multiple-Input Single-Output (MISO) Broadcast Channel (BC) in the so-called Distributed CSIT regime, with application to decentralized wireless networks. This regime…

Information Theory · Computer Science 2017-02-15 Antonio Bazco , Paul de Kerret , David Gesbert , Nicolas Gresset

The paper establishes the optimal generalized degrees of freedom (GDOF) of 3-user $M \times N$ multiple-input multiple-output (MIMO) Gaussian interference channel (GIC) in which each transmitter has $M$ antennas and each receiver has $N$…

Information Theory · Computer Science 2012-08-29 Jung Hyun Bae , Jungwon Lee , Inyup Kang

We show that an M X N user MIMO X network with A antennas at each node has AMN/(M+N-1) degrees of freedom (DoF), thus resolving in this case a discrepancy between the spatial scale invariance conjecture (scaling the number of antennas at…

Information Theory · Computer Science 2013-08-23 Hua Sun , Chunhua Geng , Tiangao Gou , Syed A. Jafar

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

Interference alignment has emerged as a powerful tool in the analysis of multi-user networks. Despite considerable recent progress, the capacity region of the Gaussian K-user interference channel is still unknown in general, in part due to…

Information Theory · Computer Science 2016-11-15 Or Ordentlich , Uri Erez , Bobak Nazer

Full-duplex (FD) cellular networks are considered in which a FD base station (BS) simultaneously supports a set of half-duplex (HD) downlink (DL) users and a set of HD uplink (UL) users. The transmitter and the receiver of the BS are…

Information Theory · Computer Science 2016-11-16 Minho Yang , Sang-Woon Jeon , Dong Ku Kim

Significant progress has been made recently in Generalized Degrees of Freedom (GDoF) characterizations of wireless interference channels (IC) and broadcast channels (BC) under the assumption of finite precision channel state information at…

Information Theory · Computer Science 2019-10-28 Yao-Chia Chan , Junge Wang , Syed A. Jafar

New families of Fisher information and entropy power inequalities for sums of independent random variables are presented. These inequalities relate the information in the sum of $n$ independent random variables to the information contained…

Information Theory · Computer Science 2024-05-07 Mokshay Madiman , Andrew Barron

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 study the Degrees-of-Freedom (DoF) in a wireless setting in which K Transmitters (TXs) aim at jointly serving K users. The performance is studied when the TXs are faced with a distributed Channel State Information (CSI) configuration in…

Information Theory · Computer Science 2020-05-14 Antonio Bazco-Nogueras , Paul de Kerret , David Gesbert , Nicolas Gresset

We study the effect of the choice of embedding geometry on the entropy of random geometric graph ensembles with soft connection functions. First we show that when the connection range is small, the entropy is dependent only on the dimension…

Probability · Mathematics 2026-01-22 Oliver Baker , Carl P. Dettmann

While deep learning (DL)-based methods have achieved remarkable success in continuous wireless resource allocation, efficient solutions for problems involving discrete variables remain challenging. This is primarily due to the zero-gradient…

Machine Learning · Computer Science 2026-03-23 Yikun Wang , Yang Li , Yik-Chung Wu , Rui Zhang

We analyze complexity in spatial network ensembles through the lens of graph entropy. Mathematically, we model a spatial network as a soft random geometric graph, i.e., a graph with two sources of randomness, namely nodes located randomly…

Physics and Society · Physics 2018-05-02 Justin P. Coon , Carl P. Dettmann , Orestis Georgiou

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

This paper studies the problem of sum-secure degrees of freedom (SDoF) of the (M,M,N,N) multiple-input multiple-output (MIMO) interference channel with local output feedback, so as to build an information-theoretic foundation and provide…

Information Theory · Computer Science 2021-02-16 Tong Zhang , Yinfei Xu , Shuai Wang , Miaowen Wen , Rui Wang

Asymptotic boundedness is a crucial property of Distributed Set-Membership Filtering (DSMFing) that prevents the unbounded growth of the set estimates caused by the wrapping effect. However, this important property remains…

Systems and Control · Electrical Eng. & Systems 2025-09-18 Yudong Li , Yirui Cong , Shimin Wang , Martin Guay , Jiuxiang Dong

This paper characterizes the degrees of freedom (DoF) regions for the multi-user vector broadcast channel with periodic channel state information (CSI) feedback. As a part of the characterization, a new transmission method called space-time…

Information Theory · Computer Science 2013-08-16 Namyoon Lee , Robert Heath