Diagonal multi-antenna coded caching for reduced subpacketization

Salehi, Mohammad Javad; Tölli, Antti (2021-02-15)
 
Avaa tiedosto
Lataukset: 

URL:
https://doi.org/10.1109/GLOBECOM42002.2020.9348098

Salehi, Mohammad Javad
Tölli, Antti
Institute of Electrical and Electronics Engineers
15.02.2021

M. Salehi and A. Tölli, "Diagonal Multi-Antenna Coded Caching for Reduced Subpacketization," GLOBECOM 2020 - 2020 IEEE Global Communications Conference, Taipei, Taiwan, 2020, pp. 1-6, doi: 10.1109/GLOBECOM42002.2020.9348098

https://rightsstatements.org/vocab/InC/1.0/
© 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
https://rightsstatements.org/vocab/InC/1.0/
doi:https://doi.org/10.1109/GLOBECOM42002.2020.9348098
Näytä kaikki kuvailutiedot
Julkaisun pysyvä osoite on
https://urn.fi/URN:NBN:fi-fe202103036403
Tiivistelmä

Abstract

Large subpacketization requirement is known to be a significant issue in the practical implementation of multiantenna coded caching schemes. In this paper, we introduce a new class of schemes applicable to any network in which the spatial degrees of freedom a is larger than or equal to the coded caching gain. This class of schemes, called diagonal coded caching (DCC), is based on a tabular representation of transmitted codewords and includes consecutive diagonal shifting of such representations over a well-defined placement table. We find the lower-bound for the required subpacketization for any DCC scheme and show that it is achievable using simple, novel algorithms. This not only enables smaller subpacketization compared to state of the art but also makes it possible to control the subpacketization by carefully adjusting the a parameter.

Kokoelmat