Imperial College London
Portrait Picture

ProfessorDenizGunduz

Faculty of Engineering, Department 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{Yang:2018:10.1109/TIT.2018.2805331,
author = {Yang, Q and Gunduz, D},
doi = {10.1109/TIT.2018.2805331},
journal = {IEEE Transactions on Information Theory},
pages = {4347--4364},
title = {Coded caching and content delivery with heterogeneous distortion requirements},
url = {http://dx.doi.org/10.1109/TIT.2018.2805331},
volume = {64},
year = {2018}
}
Download

RIS format (EndNote, RefMan)

TY  - JOUR
AB  - Cache-aided coded content delivery is studied for devices with diverse quality-of-service requirements, specified by a different average distortion target. The network consists of a server holding a database of independent contents, and users equipped with local caches of different capacities. User caches are filled by the server during a low traffic period without the knowledge of particular user demands. As opposed to the current literature, which assumes that the users request files in their entirety, it is assumed that the users in the system have distinct distortion requirements; and therefore, each user requests a single file from the database to be served at a different distortion level. Our goal in this paper is to characterize the minimum delivery rate the server needs to transmit over an error-free shared link to satisfy all possible demand combinations at the requested distortion levels, considering both centralized and decentralized cache placement. For centralized cache placement, the optimal delivery rate is characterized for the two-file two-user scenario for any pair of target distortion requirements, when the underlying source distribution is successively refinable. For the two-user scenario with more than two successively refinable files, the optimal scheme is characterized when the cache capacities of the users are the same and the number of files is a multiple of 3. For the general source distribution, not necessarily successively refinable, and with arbitrary number of users and files, a layered caching and delivery scheme is proposed, assuming that scalable source coding is employed at the server. This allows dividing the problem into two subproblems: the lossless caching of each layer with heterogeneous cache sizes, and cache allocation among layers. A delivery rate minimization problem is formulated and solved numerically for each layer; while two different schemes are proposed to allocate user caches among layers, namely, proportional cache
AU  - Yang,Q
AU  - Gunduz,D
DO  - 10.1109/TIT.2018.2805331
EP  - 4364
PY  - 2018///
SN  - 0018-9448
SP  - 4347
TI  - Coded caching and content delivery with heterogeneous distortion requirements
T2  - IEEE Transactions on Information Theory
UR  - http://dx.doi.org/10.1109/TIT.2018.2805331
UR  - http://hdl.handle.net/10044/1/56760
VL  - 64
ER  -
Download