2020 IEEE International Symposium
on Information Theory
21-26 June 2020 • Los Angeles, California, USA
| Paper ID | N.3.5 | ||
| Paper Title | An Upper Bound on the Capacity-Memory Tradeoff of Interleavable Discrete Memoryless Broadcast Channels with Uncoded Prefetching | ||
| Authors | Mohamed Salman, Mahesh Varanasi, University of Colorado-Boulder, United States | ||
| Session | N.3: Coded Caching I | ||
| Presentation | Lecture | ||
| Track | Networking and Network Coding | ||
| Manuscript | Click here to download the manuscript | ||
| Virtual Presentation | Click here to watch in the Virtual Symposium | ||
| Abstract | The $K$-receiver discrete memoryless (DM) broadcast channel (BC) is considered in which each receiver is equipped with a cache memory of the same size. We obtain an upper bound on the capacity-memory tradeoff with uncoded pre-fetching, the highest rate of reliable communication for given cache size. This bound holds for the interleavable DM BC, a class of channels that subsumes the $K$-receiver degraded DM BC and the three-receiver less noisy DM BC. We then specialize our bound to the Gaussian BC, and show that it is tighter than that recently proposed in the literature for coded pre-fetching for a wide range of cache sizes as would be expected, but the two bounds coincide for sufficiently large cache size. In the two-receiver case, our bound is tight in that it is the exact capacity-memory trade-off with uncoded prefetching which implies that, in this case, coded prefetching does not enhance the capacity-memory tradeoff for sufficiently large cache size. | ||
Plan Ahead
2021 IEEE International Symposium on Information Theory
11-16 July 2021 | Melbourne, Victoria, Australia
