Resolving the worst-User bottleneck of coded caching: Exploiting finite file sizes

In the context of the L-antenna Multiple-Input Single Output broadcast channel with K receivers, each having normalized cache size γ, we pair a fundamentally novel algorithm

Clerckx, “On coded caching in the over- loaded miso broadcast channel,” in IEEE International Symposium on Information Theory (ISIT), pp. Elia, “Cache-aided cooperation with no

A variety of realistic scenarios — such as when cache- aided base stations serve users in cellular networks — calls for exploring coded caching in the presence of shared caches,

For this setting, for two opposing memory regimes, we propose novel caching and coded delivery schemes which maximize the local caching gain, and achieve a coding gain larger than 1+

An interesting outcome is the following: starting from a single- stream centralized coded caching setting with normalized cache size γ, then every addition of an extra transmit

This ability of single-antenna coded caching to serve a scaling number of users at a time, without any channel state informa- tion at the transmitter (CSIT), offered an alternative

Elia, “Adding transmitters dramatically boosts Coded-Caching gains for finite file sizes,” Journal of Selected Areas in Communications (JSAC), 2018..

Example 1: In a BC with γ = 1/100 and L = 1, allowing for caching gains of G = Kγ = 10 (additional users due to caching), would require S 1 = 1000 10 > 10 23 so in practice