A converse bound for cache-aided interference networks

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

[thumbnail of 08645486.pdf] PDF

Download (256kB)


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
Divisions: Faculty of Engineering and Natural Sciences > Academic programs > Electronics
Faculty of Engineering and Natural Sciences
Depositing User: Özgür Erçetin
Date Deposited: 26 Jul 2019 22:33
Last Modified: 13 Jun 2023 10:55
URI: https://research.sabanciuniv.edu/id/eprint/37402

Actions (login required)

View Item
View Item