A converse bound for cache-aided interference networks

Warning The system is temporarily closed to updates for reporting purpose.

Girgis Bebawy, Antonious Mamdouh and Erçetin, Özgür and Nafie, Mohammed and Elbatt, Tamer (2019) A converse bound for cache-aided interference networks. In: 52nd Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, CA, USA

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader

Official URL: http://dx.doi.org/10.1109/ACSSC.2018.8645486


In this paper, an interference network with arbitrary number of transmitters and receivers is studied, where each transmitter is equipped with a finite size cache. We obtain an information-theoretic lower bound on both the peak normalized delivery lime (NDT), and the expected NDT of cache-aided interference networks with uniform content popularity. For the peak NDT, we show that our lower bound is strictly tighter than the hound in the literature for small cache sizes. Moreover, we show that the feasibility region on the expected NDT is bigger than that of the peak NDT.

Item Type:Papers in Conference Proceedings
Subjects:T Technology > TK Electrical engineering. Electronics Nuclear engineering > TK5101-6720 Telecommunication
ID Code:37402
Deposited By:Özgür Erçetin
Deposited On:26 Jul 2019 22:33
Last Modified:26 Jul 2019 22:33

Repository Staff Only: item control page