We address the worst-user bottleneck of wireless coded caching, which is known to severely diminish cache-aided multicasting gains due to the fundamental worst-channel limitation of multicasting transmission. We consider the quasi-static Rayleigh fading Broadcast Channel, for which we first show that the effective coded caching gain of the XOR-based standard coded-caching scheme completely vanishes in the low-SNR regime. Then, we reveal that this collapse is not intrinsic to coded caching. We do so by presenting a novel scheme that can fully recover the coded caching gains by capitalizing on one aspect that has to date remained unexploited: the shared side information brought about by the effectively unavoidable file-size constraint. As a consequence, the worst-user effect is dramatically ameliorated, as it is substituted by a much more subtle worst-group-of-users effect, where the suggested grouping is fixed, and it is decided before the channel or the demands are known. In some cases, the theoretical gains are completely recovered, and this is done without any user selection technique. We analyze the achievable rate performance of the proposed scheme and derive insightful performance approximations which prove to be very precise.
翻译:我们处理无线代码化缓存的最坏用户瓶颈问题,因为众所周知,无线代码化缓存会大大减少了由于多播传输的根本性最坏渠道限制而导致的缓存缓存缓冲效应。我们考虑的是半静态的雷利利淡化广播频道,为此我们首先表明,以XOR为基础的标准代码化缓存计划的有效代码化缓存收益在低SNR制度下完全消失。然后,我们透露,这一崩溃并不是编码化缓存的内在因素。我们这样做的方法是一个新颖的计划,它能够完全恢复编码化的缓存收益,因为迄今为止一直没有利用的一个方面:即有效不可避免的文件规模限制带来的共享侧信息。结果,最坏用户效应得到极大改善,因为其代之而代之的是更微妙的最坏的用户群体效应,即建议的组合是固定的,而且是在频道或需求被了解之前决定的。在某些情况下,理论性收益是完全恢复的,而这项工作是在没有任何用户选择技术的情况下完成的。我们分析了所拟议的计划可以实现的进度,并得出精确的概貌。