English
Related papers

Related papers: Fundamental Limits of Cache-Aided Interference Man…

200 papers

A practical barrier to the implementation of cache-aided networks is dynamic and unpredictable user behavior. In dynamic setups, users can freely depart and enter the network at any moment. The shared caching concept has the potential to…

Information Theory · Computer Science 2023-04-25 Milad Abolpour , MohammadJavad Salehi , Antti Tölli

Degrees of freedom (DoF) gains are studied in wireless networks with cooperative transmission under a backhaul load constraint that limits the average number of messages that can be delivered from a centralized controller to base station…

Information Theory · Computer Science 2018-11-27 Meghana Bande , Aly El Gamal , Venugopal V. Veeravalli

This is an extended journal version of the conference paper published in ISIT 2025; submitted to IEEE Transactions on Communications (TCOM). Integrating coded caching (CC) into multiple-input multiple-output (MIMO) communications…

Information Theory · Computer Science 2026-03-20 Mohammad NaseriTehrani , MohammadJavad Salehi , Antti Tölli

This paper studies the fundamental tradeoff between storage and latency in a general wireless interference network with caches equipped at all transmitters and receivers. The tradeoff is characterized by an information-theoretic metric,…

Information Theory · Computer Science 2018-02-21 Fan Xu , Meixia Tao , Kangqi Liu

We study a layered $K$-user $M$-hop Gaussian relay network consisting of $K_m$ nodes in the $m^{\operatorname{th}}$ layer, where $M\geq2$ and $K=K_1=K_{M+1}$. We observe that the time-varying nature of wireless channels or fading can be…

Information Theory · Computer Science 2015-03-17 Sang-Woon Jeon , Sae-Young Chung , Syed A. Jafar

Coded caching (CC) can substantially enhance network performance by leveraging memory as an additional communication resource. However, the use of CC is challenging in various practical applications due to dynamic user behavior. The…

Information Theory · Computer Science 2024-05-07 Milad Abolpour , MohammadJavad Salehi , Antti Tölli

We consider the cache-aided multiple-input single-output (MISO) broadcast channel, which consists of a server with $L$ antennas and $K$ single-antenna users, where the server contains $N$ files of equal length and each user is equipped with…

Information Theory · Computer Science 2022-03-04 Ting Yang , Kai Wan , Minquan Cheng , Giuseppe Caire

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

A centralized coded caching system, consisting of a server delivering N popular files, each of size F bits, to K users through an error-free shared link, is considered. It is assumed that each user is equipped with a local cache memory with…

Information Theory · Computer Science 2016-12-15 Mohammad Mohammadi Amiri , Deniz Gunduz

The degrees of freedom (DoF) available for communication provides an analytically tractable way to characterize the information-theoretic capacity of interference channels. In this paper, the DoF of a K-user interference channel is studied…

Information Theory · Computer Science 2016-11-15 Aly El Gamal , V. Sreekanth Annapureddy , Venugopal V. Veeravalli

In wireless networks, link strengths are often affected by some topological factors such as propagation path loss, shadowing and inter-cell interference. Thus, different users in the network might experience different link strengths. In…

Information Theory · Computer Science 2019-10-30 Jinyuan Chen

We consider a cooperative X-channel with $\sf K$ transmitters (TXs) and $\sf K$ receivers (Rxs) where Txs and Rxs are gathered into groups of size $\sf r$ respectively. Txs belonging to the same group cooperate to jointly transmit a message…

Information Theory · Computer Science 2022-03-10 Yue Bi , Michèle Wigger , Philippe Ciblat , Yue Wu

This paper studies the fundamental limits of the shared-link coded caching problem with correlated files, where a server with a library of $N$ files communicates with $K$ users who can locally cache $M$ files. Given an integer $r \in [N]$,…

Information Theory · Computer Science 2021-06-15 Kai Wan , Daniela Tuninetti , Mingyue Ji , Giuseppe Caire

We propose a new caching scheme where linear combinations of the file segments are cached at the users, for the cases where the number of files is no greater than the number of users. When a user requests a certain file in the delivery…

Information Theory · Computer Science 2016-05-02 Chao Tian , Jun Chen

This paper presents a new achievable scheme for coded caching systems with $\mathsf{N}$ files, $\mathsf{K}=\mathsf{N}$ users, and cache size $\mathsf{M}=1/(\mathsf{N}-1)$. The scheme employs linear coding during the cache placement phase,…

Information Theory · Computer Science 2024-06-11 Yinbin Ma , Daniela Tuninetti

This paper considers a $K$-cell multiple access channel with inter-symbol interference. The primary finding of this paper is that, without instantaneous channel state information at the transmitters (CSIT), the sum degrees-of-freedom (DoF)…

Information Theory · Computer Science 2017-04-11 Yo-Seb Jeon , Namyoon Lee , Ravi Tandon

An emerging trend of next generation communication systems is to provide network edges with additional capabilities such as additional storage resources in the form of caches to reduce file delivery latency. To investigate this aspect, we…

Information Theory · Computer Science 2017-11-08 Jaber Kakar , Alaa Alameer , Anas Chaaban , Aydin Sezgin , Arogyaswami Paulraj

The study of degrees of freedom (DoF) of multiuser channels has led to the development of important interference managing schemes, such as interference alignment (IA) and interference neutralization. However, while the integer DoF have been…

Information Theory · Computer Science 2014-12-24 Edin Zhang , Chiachi Huang , Huai-Yan Feng

We characterize the degrees of freedom (DoF) of multi-way relay MIMO interference networks. In particular, we consider a wireless network consisting of 4 user nodes, each with M antennas, and one N-antenna relay node. In this network, each…

Information Theory · Computer Science 2014-01-23 Chenwei Wang

This paper investigates the coded caching problem in a multi-access multiple-input single-output (MAMISO) network with the combinatorial topology. The considered system consists of a server containing $N$ files, $\Lambda$ cache nodes, and…

Information Theory · Computer Science 2026-01-19 Siying Luo , Youlong Wu , Mingming Zhang , Minquan Cheng , Dianhua Wu