Cache-Aided Two-User Broadcast Channels with State Information at Receivers

Hadi Reisizadeh; Mohammad Ali Maddah-Ali; Soheil Mohajer

doi:10.1109/ISIT.2019.8849820

Cache-Aided Two-User Broadcast Channels with State Information at Receivers

Hadi Reisizadeh, Mohammad Ali Maddah-Ali, Soheil Mohajer

Electrical and Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Scopus citations

Abstract

A two-user coded caching problem is studied in a joint source-channel coding framework. A source generates symbols at a certain rate for each file in the database, and a fixed fraction of the symbols are cached at each user. The delivery phase of coded caching takes place over a time-varying erasure broadcast channel, where the channel state information is only available at the receivers. The maximum source rate to keep up with the ergodic rate of both users is characterized.

Original language	English (US)
Title of host publication	2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	16-20
Number of pages	5
ISBN (Electronic)	9781538692912
DOIs	https://doi.org/10.1109/ISIT.2019.8849820
State	Published - Jul 2019
Event	2019 IEEE International Symposium on Information Theory, ISIT 2019 - Paris, France Duration: Jul 7 2019 → Jul 12 2019

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2019-July
ISSN (Print)	2157-8095

Conference

Conference	2019 IEEE International Symposium on Information Theory, ISIT 2019
Country/Territory	France
City	Paris
Period	7/7/19 → 7/12/19

Bibliographical note

Funding Information:
The work is supported in part by the National Science Foundation under Grant CCF-1749981.

Publisher Copyright:
© 2019 IEEE.

Access

10.1109/ISIT.2019.8849820

OpenUrl availability

Full text

Cite this

Reisizadeh, H., Maddah-Ali, M. A., & Mohajer, S. (2019). Cache-Aided Two-User Broadcast Channels with State Information at Receivers. In 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings (pp. 16-20). Article 8849820 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2019-July). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2019.8849820

Cache-Aided Two-User Broadcast Channels with State Information at Receivers. / Reisizadeh, Hadi; Maddah-Ali, Mohammad Ali ; Mohajer, Soheil.
2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2019. p. 16-20 8849820 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2019-July).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Reisizadeh, H, Maddah-Ali, MA & Mohajer, S 2019, Cache-Aided Two-User Broadcast Channels with State Information at Receivers. in 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings., 8849820, IEEE International Symposium on Information Theory - Proceedings, vol. 2019-July, Institute of Electrical and Electronics Engineers Inc., pp. 16-20, 2019 IEEE International Symposium on Information Theory, ISIT 2019, Paris, France, 7/7/19. https://doi.org/10.1109/ISIT.2019.8849820

Reisizadeh H, Maddah-Ali MA , Mohajer S. Cache-Aided Two-User Broadcast Channels with State Information at Receivers. In 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings. Institute of Electrical and Electronics Engineers Inc. 2019. p. 16-20. 8849820. (IEEE International Symposium on Information Theory - Proceedings). doi: 10.1109/ISIT.2019.8849820

@inproceedings{68af703fc02f401fbce007749b1ebc5d,

title = "Cache-Aided Two-User Broadcast Channels with State Information at Receivers",

abstract = "A two-user coded caching problem is studied in a joint source-channel coding framework. A source generates symbols at a certain rate for each file in the database, and a fixed fraction of the symbols are cached at each user. The delivery phase of coded caching takes place over a time-varying erasure broadcast channel, where the channel state information is only available at the receivers. The maximum source rate to keep up with the ergodic rate of both users is characterized.",

author = "Hadi Reisizadeh and Maddah-Ali, {Mohammad Ali} and Soheil Mohajer",

note = "Funding Information: The work is supported in part by the National Science Foundation under Grant CCF-1749981. Publisher Copyright: {\textcopyright} 2019 IEEE.; 2019 IEEE International Symposium on Information Theory, ISIT 2019 ; Conference date: 07-07-2019 Through 12-07-2019",

year = "2019",

month = jul,

doi = "10.1109/ISIT.2019.8849820",

language = "English (US)",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "16--20",

booktitle = "2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings",

}

TY - GEN

T1 - Cache-Aided Two-User Broadcast Channels with State Information at Receivers

AU - Reisizadeh, Hadi

AU - Maddah-Ali, Mohammad Ali

AU - Mohajer, Soheil

PY - 2019/7

Y1 - 2019/7

N2 - A two-user coded caching problem is studied in a joint source-channel coding framework. A source generates symbols at a certain rate for each file in the database, and a fixed fraction of the symbols are cached at each user. The delivery phase of coded caching takes place over a time-varying erasure broadcast channel, where the channel state information is only available at the receivers. The maximum source rate to keep up with the ergodic rate of both users is characterized.

AB - A two-user coded caching problem is studied in a joint source-channel coding framework. A source generates symbols at a certain rate for each file in the database, and a fixed fraction of the symbols are cached at each user. The delivery phase of coded caching takes place over a time-varying erasure broadcast channel, where the channel state information is only available at the receivers. The maximum source rate to keep up with the ergodic rate of both users is characterized.

UR - http://www.scopus.com/inward/record.url?scp=85073171117&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85073171117&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2019.8849820

DO - 10.1109/ISIT.2019.8849820

M3 - Conference contribution

AN - SCOPUS:85073171117

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 16

EP - 20

BT - 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2019 IEEE International Symposium on Information Theory, ISIT 2019

Y2 - 7 July 2019 through 12 July 2019

ER -

Cache-Aided Two-User Broadcast Channels with State Information at Receivers

Abstract

Publication series

Conference

Bibliographical note

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this