English
Related papers

Related papers: Feedback-Aided Coded Caching for the MISO BC with …

200 papers

Coded caching is a recently proposed technique that achieves significant performance gains for cache networks compared to uncoded caching schemes. However, this substantial coding gain is attained at the cost of large delivery delay, which…

Information Theory · Computer Science 2016-11-15 Urs Niesen , Mohammad Ali Maddah-Ali

The impact of imperfect CSIT on the degrees of freedom (DoF) of a time correlated MISO Broadcast Channel has drawn a lot of attention recently. Maddah-Ali and Tse have shown that the completely stale CSIT still benefit the DoF. In very…

Information Theory · Computer Science 2012-11-20 Chenxi Hao , Bruno Clerckx

In this paper, we consider a multiuser MISO downlink cognitive network coexisting with a primary network. With the purpose of exploiting the spatial degree of freedom to counteract the inter-network interference and intra-network…

Information Theory · Computer Science 2013-10-17 Xiaoming Chen , Zhaoyang Zhang , Chau Yuen

We study the problem of cache-aided communication for cellular networks with multi-user and multiple antennas at finite signal-to-noise ratio. Users are assumed to have non-symmetric links, modeled by wideband fading channels. We show that…

Information Theory · Computer Science 2018-08-09 Itsik Bergel , Soheil Mohajer

We consider a $K$-user multiple-input single-output (MISO) broadcast channel (BC) where the channel state information (CSI) of user $i(i=1,2,\ldots,K)$ may be either perfect (P), delayed (D) or not known (N) at the transmitter with…

Information Theory · Computer Science 2013-11-27 Borzoo Rassouli , Chenxi Hao , Bruno Clerckx

In this paper, we consider a two-cell interfering two-user multiple-input multiple-output multiple access channel (MIMO-MAC) with limited feedback. We first investigate the multiplexing gain of such channel when users have perfect channel…

Information Theory · Computer Science 2010-10-06 Namyoon Lee , Wonjae Shin , Bruno Clerckx

Coded caching utilizes proper file subpacketization and coded delivery to make full use of the multicast opportunities in content delivery, to alleviate file transfer load in massive content delivery scenarios. Most existing work considers…

Information Theory · Computer Science 2021-10-01 Jialing Liao , Olav Tirkkonen

We consider the problem of designing decentralized schemes for coded caching. In this problem there are $K$ users each caching $M$ files out of a library of $N$ total files. The question is to minimize $R$, the number of broadcast…

Information Theory · Computer Science 2018-01-25 Yitao Chen , Karthikeyan Shanmugam , Alexandros G. Dimakis

Caching popular contents at the edge of the network can positively impact the performance and future sustainability of wireless networks in several ways, e.g., end-to-end access delay reduction and peak rate increase. In this paper, we aim…

Information Theory · Computer Science 2017-03-21 Marco Maso , Italo Atzeni , Imène Ghamnia , Ejder Baştuğ , Mérouane Debbah

We focus on a dense cellular network, in which a limited-size cache is available at every Base Station (BS). In order to optimize the overall performance of the system in such scenario, where a significant fraction of the users is covered…

Networking and Internet Architecture · Computer Science 2018-06-15 Emilio Leonardi , Giovanni Neglia

In this paper, we proposed an effective and efficient multi-core shared-cache design optimization approach based on reuse-distance analysis of the data traces of target applications. Since data traces are independent of system hardware…

Performance · Computer Science 2021-09-13 Hsin-Yu Ho , Ren-Song Tsay

Caching is a technique to reduce peak traffic rates by prefetching popular content into memories at the end users. Conventionally, these memories are used to deliver requested content in part from a locally cached copy rather than through…

Information Theory · Computer Science 2014-05-06 Mohammad Ali Maddah-Ali , Urs Niesen

We propose a new decentralized coded caching scheme for a two-phase caching network, where the data placed in user caches in the prefetching phase are random portions of a maximal distance separable (MDS) coded version of the original…

Information Theory · Computer Science 2018-06-27 Yi-Peng Wei , Sennur Ulukus

In the context of coded caching in the $K$-user BC, our work reveals the surprising fact that having multiple ($L$) transmitting antennas, dramatically ameliorates the long-standing subpacketization bottleneck of coded caching by reducing…

Information Theory · Computer Science 2018-02-12 Eleftherios Lampiris , Petros Elia

The Degrees of Freedom (DoF) of a K-User MISO Broadcast Channel (BC) is studied when the Transmitter (TX) has access to a delayed channel estimate in addition to an imperfect estimate of the current channel. The current estimate could be…

Information Theory · Computer Science 2013-01-11 Paul de Kerret , Xinping Yi , David Gesbert

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

One of the famous problems in communications was the so-called "PN" problem in the Broadcast Channel, which refers to the setting where a fixed set of users provide perfect Channel State Information (CSI) to a multi-antenna transmitter,…

Information Theory · Computer Science 2021-02-26 Antonio Bazco-Nogueras , Petros Elia

Many recent caching systems aim to improve miss ratios, but there is no good sense among practitioners of how much further miss ratios can be improved. In other words, should the systems community continue working on this problem?…

Performance · Computer Science 2018-07-09 Daniel S. Berger , Nathan Beckmann , Mor Harchol-Balter

The degrees of freedom (DoF) of the two-user multiple-input single-output (MISO) broadcast channel (BC) are studied under the assumption that the form, I_i, i=1,2, of the channel state information at the transmitter (CSIT) for each user's…

Information Theory · Computer Science 2012-08-28 Ravi Tandon , Syed A. Jafar , Shlomo Shamai , H. Vincent Poor

A cache-aided compression problem with perfect privacy is studied, where a server has access to a database of $N$ files, $(Y_1,...,Y_N)$, each of size $F$ bits. The server is connected to $K$ users through a shared link, where each user has…

Information Theory · Computer Science 2025-06-17 Amirreza Zamani , Mikael Skoglund