Imperial College London

ProfessorDenizGunduz

Faculty of EngineeringDepartment of Electrical and Electronic Engineering

Professor in Information Processing
 
 
 
//

Contact

 

+44 (0)20 7594 6218d.gunduz Website

 
 
//

Assistant

 

Ms Joan O'Brien +44 (0)20 7594 6316

 
//

Location

 

1016Electrical EngineeringSouth Kensington Campus

//

Summary

 

Publications

Citation

BibTex format

@article{Mohammadi:2017:10.1109/TCOMM.2016.2638841,
author = {Mohammadi, Amiri M and Gunduz, D},
doi = {10.1109/TCOMM.2016.2638841},
journal = {IEEE Transactions on Communications},
pages = {806--815},
title = {Fundamental limits of coded caching: improved delivery rate-cache capacity tradeoff},
url = {http://dx.doi.org/10.1109/TCOMM.2016.2638841},
volume = {65},
year = {2017}
}

RIS format (EndNote, RefMan)

TY  - JOUR
AB - A centralized coded caching system, consisting of a server delivering N popular files, each of size F bits, to K users through an error-free shared link, is considered. It is assumed that each user is equipped with a local cache memory with capacity MF bits, and contents can be proactively cached into these caches over a low traffic period, however, without the knowledge of the user demands. During the peak traffic period, each user requests a single file from the server. The goal is to minimize the number of bits delivered by the server over the shared link, known as the delivery rate, over all user demand combinations. A novel coded caching scheme for the cache capacity of M = (N-1)/K is proposed. It is shown that the proposed scheme achieves a smaller delivery rate than the existing coded caching schemes in the literature, when K > N ≥ 3. Furthermore, we argue that the delivery rate of the proposed scheme is within a constant multiplicative factor of 2 of the optimal delivery rate for cache capacities 1/K ≤ M ≤ (N -1)/K, when K > N ≥ 3.
AU - Mohammadi,Amiri M
AU - Gunduz,D
DO - 10.1109/TCOMM.2016.2638841
EP - 815
PY - 2017///
SN - 0090-6778
SP - 806
TI - Fundamental limits of coded caching: improved delivery rate-cache capacity tradeoff
T2 - IEEE Transactions on Communications
UR - http://dx.doi.org/10.1109/TCOMM.2016.2638841
UR - https://ieeexplore.ieee.org/document/7782423
UR - http://hdl.handle.net/10044/1/43111
VL - 65
ER -