Ecole d'ingénieur et centre de recherche en Sciences du numérique

Achieving full multiplexing and unbounded caching gains with bounded feedback resources

Lampiris, Eleftherios; Elia, Petros

ISIT 2018, International Symposium on Information Theory, 17-22 June 2018, Vail, Colorado, USA

In the context of the K-user MISO broadcast channel with cache-aided receivers, recent multi-antenna coded-caching techniques have sought to complement the traditional multiplexing gains associated to multiple (L) antennas, with the (potentially unbounded) caching gains (G) associated to coded caching. To date, all known existing efforts to combine the two gains, either resulted in a maximum known DoF L+G that required though CSIT on all (L+G) users served at a time (i.e., that induced potentially unbounded CSIT costs that matched the DoF gains), or resulted in a much compromised DoF where multiplexing gains came at the expense of bounded caching gains. We present here a new multi-antenna coded caching algorithm that introduces a new XOR generation structure which completely untangles caching gains from CSIT, allowing for the same desired sum-DoF of L+G with a much reduced CSIT of only L channel vectors at a time (L \times L channel matrix). This means that for the first time in multi-antenna coded caching, one can achieve full multiplexing gains and unbounded caching gains, at a much reduced and bounded CSIT cost usually associated to supporting only multiplexing gains. In the end, the result solidifies the role of coded caching as a method for reducing feedback requirements in multi-antenna environments.

Document Doi Bibtex

Titre:Achieving full multiplexing and unbounded caching gains with bounded feedback resources
Type:Conférence
Langue:English
Ville:Vail
Pays:ÉTATS-UNIS
Date:
Département:Systèmes de Communication
Eurecom ref:5580
Copyright: © 2018 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Bibtex: @inproceedings{EURECOM+5580, doi = {http://dx.doi.org/10.1109/ISIT.2018.8437704}, year = {2018}, title = {{A}chieving full multiplexing and unbounded caching gains with bounded feedback resources}, author = {{L}ampiris, {E}leftherios and {E}lia, {P}etros}, booktitle = {{ISIT} 2018, {I}nternational {S}ymposium on {I}nformation {T}heory, 17-22 {J}une 2018, {V}ail, {C}olorado, {USA}}, address = {{V}ail, {\'{E}}{TATS}-{UNIS}}, month = {06}, url = {http://www.eurecom.fr/publication/5580} }
Voir aussi: