Decentralized caching and coded delivery over Gaussian broadcast channels

A cache-aided K-user Gaussian broadcast channel (BC) is considered. The transmitter has a library of N equal-rate files, from which each user demands one. The impact of the equal-capacity receiver cache memories on the minimum required transmit power to satisfy all user demands is studied. Decentralized caching with uniformly random demands is considered, and both the minimum average power (averaged over all demand combinations) and the minimum peak power (minimum power required to satisfy the worst-case demand combination) are studied. Upper and lower bounds are presented on the minimum required average and peak transmit power as a function of the cache capacity, assuming uncoded cache placement. The gaps between the upper and lower bounds on both the minimum peak and average power values are shown to be relatively small through numerical results, particularly for large cache capacities.

[1]  Jingjing Zhang,et al.  Wireless coded caching: A topological perspective , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[2]  Urs Niesen,et al.  Decentralized Caching Attains Order-Optimal Memory-Rate Tradeoff , 2013, ArXiv.

[3]  Michèle Wigger,et al.  Noisy Broadcast Networks With Receiver Caching , 2016, IEEE Transactions on Information Theory.

[4]  Deniz Gündüz,et al.  Cache-aided data delivery over erasure broadcast channels , 2017, 2017 IEEE International Conference on Communications (ICC).

[5]  Zhi Chen,et al.  Fundamental limits of caching: improved bounds for users with small buffers , 2016, IET Commun..

[6]  Urs Niesen,et al.  Fundamental Limits of Caching , 2014, IEEE Trans. Inf. Theory.

[7]  Mohammad Ali Maddah-Ali,et al.  The exact rate-memory tradeoff for caching with uncoded prefetching , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[8]  Mohammad Mohammadi Amiri,et al.  Fundamental Limits of Coded Caching: Improved Delivery Rate-Cache Capacity Trade-off , 2016 .

[9]  Urs Niesen,et al.  Decentralized coded caching attains order-optimal memory-rate tradeoff , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[10]  Patrick P. Bergmans,et al.  Random coding theorem for broadcast channels with degraded components , 1973, IEEE Trans. Inf. Theory.

[11]  Kai Wan.  On Caching with More Users than Files , 2018 .

[12]  Kevin C. Almeroth,et al.  The Use of Multicast Delivery to Provide a Scalable and Interactive Video-on-Demand Service , 1996, IEEE J. Sel. Areas Commun..

[13]  Deniz Gündüz,et al.  Coded caching for a large number of users , 2016, 2016 IEEE Information Theory Workshop (ITW).

[14]  Feng Yang,et al.  The Performance Analysis of Coded Cache in Wireless Fading Channel , 2015, ArXiv.

[15]  Deniz Gündüz,et al.  Improved delivery rate-cache capacity trade-off for centralized coded caching , 2016, 2016 International Symposium on Information Theory and Its Applications (ISITA).

[16]  Chao Tian,et al.  Symmetry, Outer Bounds, and Code Constructions: A Computer-Aided Investigation on the Fundamental Limits of Caching , 2016, 2017 IEEE International Symposium on Information Theory (ISIT).

[17]  Mohammad Ali Maddah-Ali,et al.  Fundamental limits of cache-aided interference management , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).