Low-Subpacketization Multi-Antenna Coded Caching for Dynamic Networks

TL;DR

This paper introduces a multi-antenna coded caching scheme for dynamic networks that uses predefined caching profiles, achieving high caching and multiplexing gains with low complexity and robustness to network changes.

Contribution

It proposes a novel caching scheme that avoids the need for prior knowledge of user count, reducing subpacketization and overhead while maintaining high performance.

Findings

Achieves caching and spatial multiplexing gains comparable to centralized schemes.

Imposes small subpacketization and beamforming overheads.

Robust under dynamic network conditions with minimal performance loss.

Abstract

Multi-antenna coded caching combines a global caching gain, proportional to the total cache size in the network, with an additional spatial multiplexing gain that stems from multiple transmitting antennas. However, classic centralized coded caching schemes are not suitable for dynamic networks as they require prior knowledge of the number of users to indicate what data should be cached at each user during the placement phase. On the other hand, fully decentralized schemes provide comparable gains to their centralized counterparts only when the number of users is very large. In this paper, we propose a novel multi-antenna coded caching scheme for dynamic networks, where instead of defining individual cache contents, we associate users with a limited set of predefined caching profiles. Then, during the delivery phase, we aim at achieving a combined caching and spatial multiplexing gain, comparable to a large extent with the ideal case of fully centralized schemes. The resulting scheme imposes small subpacketization and beamforming overheads, is robust under dynamic network conditions, and incurs small finite-SNR performance loss compared with centralized schemes.