Full Coded Caching Gains for Cache-less Users

by   Eleftherios Lampiris, et al.

The work identifies the performance limits of the multiple-input single-output broadcast channel where cache-aided users coincide with users that do not have caches. The main contribution is a new algorithm that employs perfect matchings on a bipartite graph to offer full multiplexing as well as full coded-caching gains to both cache-aided as well as cache-less users. This performance is shown to be within a factor of at most 3 from the optimal, under the assumption of linear one-shot schemes. 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 antenna allows for the addition of approximately 1/γ extra cache-less users, at no added delay costs. For example, starting from a single-stream coded caching setting with γ = 1/100, every addition of a transmit antenna, allows for serving approximately an additional 100 more cache-less users, without any increase in the overall delay. Finally the work reveals the role of multiple antennas in removing the penalties typically associated to cache-size unevenness, as it shows that the performance in the presence of both cache-less and cache-aided users, matches the optimal (under uncoded cache placement) performance of the corresponding symmetric case where the same cumulative cache volume is split evenly across all users.


page 1

page 2

page 3

page 4


Multiple-antenna Placement Delivery Array for Cache-aided MISO Systems

We consider the cache-aided multiple-input single-output (MISO) broadcas...

Adding transmitters dramatically boosts coded-caching gains for finite file sizes

In the context of coded caching in the K-user BC, our work reveals the s...

Resolving a Feedback Bottleneck of Multi-Antenna Coded Caching

The work here makes substantial progress towards resolving the well know...

Fundamental Limits of Caching in Heterogeneous Networks with Uncoded Prefetching

The work explores the fundamental limits of coded caching in heterogeneo...

Fundamental Limits of Wireless Caching under Uneven-Capacity Channels

This work identifies the fundamental limits of cache-aided coded multica...

Fundamental Limits of Cache-Aided Broadcast Networks with User Cooperation

We consider cache-aided broadcast networks with user cooperation, where ...

Coded Caching in Networks with Heterogeneous User Activity

This work elevates coded caching networks from their purely information-...

Please sign up or login with your details

Forgot password? Click here to reset