Centralized caching and delivery of correlated contents over a Gaussian broadcast channel

Content delivery in a multi-user cache-aided broadcast network is studied, where a server holding a database of correlated contents communicates with the users over a Gaussian broadcast channel (BC). The minimum transmission power required to satisfy all possible demand combinations is studied, when the users are equipped with caches of equal size. A lower bound on the required transmit power is derived, assuming uncoded cache placement, as a function of the cache capacity. A centralized joint cache and channel coding scheme is proposed, which not only utilizes the user's local caches, but also exploits the correlation among the contents in the database. This scheme provides an upper bound on the minimum required transmit power for a given cache capacity. Our results indicate that exploiting the correlations among the contents in a cache-aided Gaussian BC can provide significant energy savings.

[1]  A. Salman Avestimehr,et al.  The Exact Rate-Memory Tradeoff for Caching With Uncoded Prefetching , 2016, IEEE Transactions on Information Theory.

[2]  Deniz Gündüz,et al.  Coded Caching and Content Delivery With Heterogeneous Distortion Requirements , 2016, IEEE Transactions on Information Theory.

[3]  Deniz Gündüz,et al.  Improved policy representation and policy search for proactive content caching in wireless networks , 2017, 2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt).

[4]  Patrick P. Bergmans,et al.  A simple converse for broadcast channels with additive white Gaussian noise (Corresp.) , 1974, IEEE Trans. Inf. Theory.

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

[6]  Jaime Llorca,et al.  On Coding for Cache-Aided Delivery of Dynamic Correlated Content , 2018, IEEE Journal on Selected Areas in Communications.

[7]  Jaime Llorca,et al.  Correlation-aware distributed caching and coded delivery , 2016, 2016 IEEE Information Theory Workshop (ITW).

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

[9]  Jaime Llorca,et al.  Rate-memory trade-off for the two-user broadcast caching network with correlated sources , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[10]  Jaime Llorca,et al.  Cache-aided coded multicast for correlated sources , 2016, 2016 9th International Symposium on Turbo Codes and Iterative Information Processing (ISTC).

[11]  Deniz Gündüz,et al.  A Reinforcement-Learning Approach to Proactive Caching in Wireless Networks , 2017, IEEE Journal on Selected Areas in Communications.

[12]  Deniz Gündüz,et al.  Centralized Caching and Delivery of Correlated Contents Over Gaussian Broadcast Channels , 2020, IEEE Transactions on Communications.

[13]  Deniz Gündüz,et al.  Centralized Coded Caching of Correlated Contents , 2018, 2018 IEEE International Conference on Communications (ICC).

[14]  Robert M. Gray,et al.  Source coding for a simple network , 1974 .

[15]  Aylin Yener,et al.  Benefits of Cache Assignment on Degraded Broadcast Channels , 2019, IEEE Transactions on Information Theory.

[16]  A. Robert Calderbank,et al.  Rate-distortion bounds on Bayes risk in supervised learning , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[17]  Jack K. Wolf,et al.  Noiseless coding of correlated information sources , 1973, IEEE Trans. Inf. Theory.

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

[19]  Michele A. Wigger,et al.  Erasure broadcast networks with receiver caching , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[20]  Jaime Llorca,et al.  Broadcast caching networks with two receivers and multiple correlated sources , 2017, 2017 51st Asilomar Conference on Signals, Systems, and Computers.

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

[22]  Jaime Llorca,et al.  Rate-Memory Trade-Off for Caching and Delivery of Correlated Sources , 2018, IEEE Transactions on Information Theory.

[23]  Sheng Yang,et al.  Content Delivery in Erasure Broadcast Channels With Cache and Feedback , 2016, IEEE Trans. Inf. Theory.

[24]  Deniz Gündüz,et al.  Cache-Aided Content Delivery Over Erasure Broadcast Channels , 2017, IEEE Transactions on Communications.

[25]  Zhi Chen Fundamental Limits of Caching: Improved Bounds For Small Buffer Users , 2014, ArXiv.

[26]  Deniz Gündüz,et al.  Caching and Coded Delivery Over Gaussian Broadcast Channels for Energy Efficiency , 2018, IEEE Journal on Selected Areas in Communications.