论文标题

在PDA和连续循环放置下具有最佳速率和线性子包装的多访问编码缓存

Multi-access Coded Caching with Optimal Rate and Linear Subpacketization under PDA and Consecutive Cyclic Placement

论文作者

Wang, Jinyu, Cheng, Minquan, Wu, Youlong

论文摘要

这项工作考虑了Hachem等人提出的多访问缓存系统,每个用户都可以以循环包裹方式访问L相邻的卡车。我们首先提出了一种称为连续循环放置的放置策略,该策略可实现最大的局部缓存增益。然后,在连续的循环放置下,我们从放置递送阵列(PDA)的角度得出了最佳的编码缓存增益,从而获得了PDA速率的下限。最后,在连续的循环放置下,我们构建了一类PDA,从而导致具有线性子包装的多访问编码的缓存方案,该方案实现了我们在某些参数的派生下界限。而对于其他参数,所达到的编码缓存增益仅比最佳速度少1个。提供了与现有方案的分析和数值比较,以验证性能。

This work considers the multi-access caching system proposed by Hachem et al., where each user has access to L neighboring caches in a cyclic wrap-around fashion. We first propose a placement strategy called the consecutive cyclic placement, which achieves the maximal local caching gain. Then under the consecutive cyclic placement, we derive the optimal coded caching gain from the perspective of Placement Delivery Array (PDA), thus obtaining a lower bound on the rate of PDA. Finally, under the consecutive cyclic placement, we construct a class of PDA, leading to a multi-access coded caching scheme with linear subpacketization, which achieves our derived lower bound for some parameters; while for other parameters, the achieved coded caching gain is only 1 less than the optimal one. Analytical and numerical comparisons of the proposed scheme with existing schemes are provided to validate the performance.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源