2019/10/23 by Salehi, MohammadJavad, Tölli, Antti, Shariatpanahi, Seyed Pooya
#FOS: Computer and information sciences #Information Theory (cs.IT)
paper · doi:10.48550/arxiv.1910.10384
Exponentially growing subpacketization is known to be a major issue for practical implementation of coded caching, specially in networks with multi-antenna communication setups. We provide a new coded caching scheme for such networks, which requires linear subpacketization and is applicable to any set of network parameters, as long as the multi-antenna gain L is larger than or equal to the global caching gain t. Our scheme includes carefully designed cache placement and delivery algorithms; which are based on circular shift of two generator arrays in perpendicular directions. It also achieves the maximum possible degrees of freedom of t+L, during any transmission interval.