We investigate the performance of multi-antenna coded caching delivery algorithms operating under practical constraints. Specifically, under the constraints of finite subpacketization and finite signal-to-noise ratio (SNR) we compare two popular algorithms, one exhibiting low subpacketization while the other transmits multicast messages, hence requiring fewer symbols for communication and resulting in increased power per transmitted symbol. Our work is motivated by the fact that, while many multi-antenna coded caching algorithms exhibit the same asymptotic performance, when factoring practical limitations such as finite subpacketization and finite SNR, the real-world performances differ significantly.
Type:
Conférence
City:
Sophia Antipolis
Date:
2021-11-10
Department:
Systèmes de Communication
Eurecom Ref:
6706
Copyright:
Copyright ITG. Personal use of this material is permitted. The definitive version of this paper was published in and is available at :
