Full Coded Caching Gains for Cache-less Users
Eleftherios Lampiris, Petros Elia

TL;DR
This paper demonstrates that multiple transmit antennas in coded caching systems can completely eliminate performance penalties caused by cache size heterogeneity, enabling full multiplexing and caching gains even for cache-less users.
Contribution
It introduces a new bipartite graph matching algorithm that achieves full multiplexing and caching gains for cache-less and cache-aided users in MISO broadcast channels.
Findings
Adding L antennas allows approximately L/γ extra cache-less users without delay increase.
Adding L-1 antennas and cache size Γ₂ increases Degrees of Freedom multiplicatively.
The proposed algorithm achieves full multiplexing and caching gains for heterogeneous user groups.
Abstract
Within the context of coded caching, the work reveals the interesting connection between having multiple transmitters and having heterogeneity in the cache sizes of the receivers. Our work effectively shows that having multiple transmit antennas -- while providing full multiplexing gains -- can also simultaneously completely remove the performance penalties that are typically associated to cache-size unevenness. Focusing on the multiple-input single-output Broadcast Channel, the work first identifies the performance limits of the extreme case where cache-aided users coincide with users that do not have caches, and then expands the analysis to the case where both user groups are cache-aided but with heterogeneous cache-sizes. In the first case, the main contribution is a new algorithm that employs perfect matchings on a bipartite graph to offer full multiplexing as well as full…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
