Gaussian broadcast channels with receiver cache assignment

Shirin Saeedi Bidokhti, Michele Wigger, Aylin Yener

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    8 Citations (Scopus)

    Abstract

    This paper considers a K-user Gaussian broadcast channel (BC) where receivers are equipped with cache memories. Lower and upper bounds are established on the capacity-memory tradeoff, i.e., the largest rate achievable for given cache-memories. The lower bound is based on a joint cache-channel coding scheme which generalizes the recently proposed piggyback coding to Gaussian BCs with unequal cache sizes. This paper also establishes lower and upper bounds on the global capacity-memory tradeoff, i.e., the maximum capacity-memory tradeoff over all possible cache assignments subject to a total cache memory constraint. The bounds match when the total cache memory is sufficiently large. It is shown that significantly larger rates can be achieved by carefully assigning larger cache memories to weaker receivers. In particular, cache allocation allows communication at rates that are (fundamentally) impossible to achieve with equal cache assignment. This shows the merit in carefully designing the cache size allocation in conjunction with channel qualities.

    Original languageEnglish (US)
    Title of host publication2017 IEEE International Conference on Communications, ICC 2017
    EditorsMerouane Debbah, David Gesbert, Abdelhamid Mellouk
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    ISBN (Electronic)9781467389990
    DOIs
    StatePublished - Jul 28 2017
    Event2017 IEEE International Conference on Communications, ICC 2017 - Paris, France
    Duration: May 21 2017May 25 2017

    Publication series

    NameIEEE International Conference on Communications
    ISSN (Print)1550-3607

    Other

    Other2017 IEEE International Conference on Communications, ICC 2017
    CountryFrance
    CityParis
    Period5/21/175/25/17

    Fingerprint

    Cache memory
    Data storage equipment
    Channel coding
    Communication

    All Science Journal Classification (ASJC) codes

    • Computer Networks and Communications
    • Electrical and Electronic Engineering

    Cite this

    Bidokhti, S. S., Wigger, M., & Yener, A. (2017). Gaussian broadcast channels with receiver cache assignment. In M. Debbah, D. Gesbert, & A. Mellouk (Eds.), 2017 IEEE International Conference on Communications, ICC 2017 [7997395] (IEEE International Conference on Communications). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICC.2017.7997395
    Bidokhti, Shirin Saeedi ; Wigger, Michele ; Yener, Aylin. / Gaussian broadcast channels with receiver cache assignment. 2017 IEEE International Conference on Communications, ICC 2017. editor / Merouane Debbah ; David Gesbert ; Abdelhamid Mellouk. Institute of Electrical and Electronics Engineers Inc., 2017. (IEEE International Conference on Communications).
    @inproceedings{d004bc15bc4c41f5943d1f20bdda7d93,
    title = "Gaussian broadcast channels with receiver cache assignment",
    abstract = "This paper considers a K-user Gaussian broadcast channel (BC) where receivers are equipped with cache memories. Lower and upper bounds are established on the capacity-memory tradeoff, i.e., the largest rate achievable for given cache-memories. The lower bound is based on a joint cache-channel coding scheme which generalizes the recently proposed piggyback coding to Gaussian BCs with unequal cache sizes. This paper also establishes lower and upper bounds on the global capacity-memory tradeoff, i.e., the maximum capacity-memory tradeoff over all possible cache assignments subject to a total cache memory constraint. The bounds match when the total cache memory is sufficiently large. It is shown that significantly larger rates can be achieved by carefully assigning larger cache memories to weaker receivers. In particular, cache allocation allows communication at rates that are (fundamentally) impossible to achieve with equal cache assignment. This shows the merit in carefully designing the cache size allocation in conjunction with channel qualities.",
    author = "Bidokhti, {Shirin Saeedi} and Michele Wigger and Aylin Yener",
    year = "2017",
    month = "7",
    day = "28",
    doi = "10.1109/ICC.2017.7997395",
    language = "English (US)",
    series = "IEEE International Conference on Communications",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",
    editor = "Merouane Debbah and David Gesbert and Abdelhamid Mellouk",
    booktitle = "2017 IEEE International Conference on Communications, ICC 2017",
    address = "United States",

    }

    Bidokhti, SS, Wigger, M & Yener, A 2017, Gaussian broadcast channels with receiver cache assignment. in M Debbah, D Gesbert & A Mellouk (eds), 2017 IEEE International Conference on Communications, ICC 2017., 7997395, IEEE International Conference on Communications, Institute of Electrical and Electronics Engineers Inc., 2017 IEEE International Conference on Communications, ICC 2017, Paris, France, 5/21/17. https://doi.org/10.1109/ICC.2017.7997395

    Gaussian broadcast channels with receiver cache assignment. / Bidokhti, Shirin Saeedi; Wigger, Michele; Yener, Aylin.

    2017 IEEE International Conference on Communications, ICC 2017. ed. / Merouane Debbah; David Gesbert; Abdelhamid Mellouk. Institute of Electrical and Electronics Engineers Inc., 2017. 7997395 (IEEE International Conference on Communications).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    TY - GEN

    T1 - Gaussian broadcast channels with receiver cache assignment

    AU - Bidokhti, Shirin Saeedi

    AU - Wigger, Michele

    AU - Yener, Aylin

    PY - 2017/7/28

    Y1 - 2017/7/28

    N2 - This paper considers a K-user Gaussian broadcast channel (BC) where receivers are equipped with cache memories. Lower and upper bounds are established on the capacity-memory tradeoff, i.e., the largest rate achievable for given cache-memories. The lower bound is based on a joint cache-channel coding scheme which generalizes the recently proposed piggyback coding to Gaussian BCs with unequal cache sizes. This paper also establishes lower and upper bounds on the global capacity-memory tradeoff, i.e., the maximum capacity-memory tradeoff over all possible cache assignments subject to a total cache memory constraint. The bounds match when the total cache memory is sufficiently large. It is shown that significantly larger rates can be achieved by carefully assigning larger cache memories to weaker receivers. In particular, cache allocation allows communication at rates that are (fundamentally) impossible to achieve with equal cache assignment. This shows the merit in carefully designing the cache size allocation in conjunction with channel qualities.

    AB - This paper considers a K-user Gaussian broadcast channel (BC) where receivers are equipped with cache memories. Lower and upper bounds are established on the capacity-memory tradeoff, i.e., the largest rate achievable for given cache-memories. The lower bound is based on a joint cache-channel coding scheme which generalizes the recently proposed piggyback coding to Gaussian BCs with unequal cache sizes. This paper also establishes lower and upper bounds on the global capacity-memory tradeoff, i.e., the maximum capacity-memory tradeoff over all possible cache assignments subject to a total cache memory constraint. The bounds match when the total cache memory is sufficiently large. It is shown that significantly larger rates can be achieved by carefully assigning larger cache memories to weaker receivers. In particular, cache allocation allows communication at rates that are (fundamentally) impossible to achieve with equal cache assignment. This shows the merit in carefully designing the cache size allocation in conjunction with channel qualities.

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

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

    U2 - 10.1109/ICC.2017.7997395

    DO - 10.1109/ICC.2017.7997395

    M3 - Conference contribution

    AN - SCOPUS:85028299137

    T3 - IEEE International Conference on Communications

    BT - 2017 IEEE International Conference on Communications, ICC 2017

    A2 - Debbah, Merouane

    A2 - Gesbert, David

    A2 - Mellouk, Abdelhamid

    PB - Institute of Electrical and Electronics Engineers Inc.

    ER -

    Bidokhti SS, Wigger M, Yener A. Gaussian broadcast channels with receiver cache assignment. In Debbah M, Gesbert D, Mellouk A, editors, 2017 IEEE International Conference on Communications, ICC 2017. Institute of Electrical and Electronics Engineers Inc. 2017. 7997395. (IEEE International Conference on Communications). https://doi.org/10.1109/ICC.2017.7997395