Graduate School and Research Center in Digital Sciences

The high dimensionality factor of coded caching: Resolving bottlenecks one antenna at a time

Lampiris, Eleftherios

Thesis

The main theme of this thesis is the combination of two opposing resources, namely the multiplexing gain, corresponding to multiple antennas, and the multicasting gain achieved in cache-aided communications. Multiple antennas, or multiple transmitters with caches, provide increased gains by separating messages, while coded caching merges messages together by exploiting cached and unwanted content to remove interference. Thus, at a first look, multiplexing and coded caching gains seem to be opposing to one another. Efforts to combine the two have shown that the gains appear to be additive. For example, in the Multiple-Input-Multiple-Output (MISO) Broadcast Channel (BC) where a Base Station, equipped with L transmit antennas, serves the demands of K receiving, single antenna users, asking files from a library of popular files, when users are equipped with caches, amounting to a total sum cache-size of t times the whole library, this network can provide the order optimal Degrees-of-Freedom (DoF) performance of DL = L + t. What we will show in this thesis is that, in many scenarios, pairing the multiplexing gains with coded caching can be a much more powerful combination, which can dramatically improve major fundamental limitations of both coded caching and multiple antenna precoding. A notable example, that will be proved in this thesis, is the role of multiple antennas on dramatically ameliorating the infamous subpacketization constraint i.e., the limitation that a coded caching gain equal to t requires each file to be segmented to an exponential number of packets. This, in practical systems can easily surpass the number of bits of a file by many orders of magnitude, thus imposing hard limits on caching gains. Specifically, we will show that in practical scenarios, where the number of subpackets needs to be finite, then L antennas can provide L times higher actual DoF compared to any single antenna Coded Caching scheme. As an example, in the single-antenna setting with K = 50 users and sum cache redundancy t = 10 in order to achieve the DoF performance of D1 = t + 1 = 11 the required subpacketization is S1 = 􀀀50 10 _≈ 1010 subfiles while on the other hand, we will show that the same system equipped with L = 2 antennas can achieve the DoF DL = t+L = 12 with subpacketization of SL = 5·104. This DoF is approximately 2 times higher compared to the DoF that could be achieved under reasonable subpacketization constraints

Document Bibtex

Title:The high dimensionality factor of coded caching: Resolving bottlenecks one antenna at a time
Type:Thesis
Language:English
City:
Date:
Department:Communication systems
Eurecom ref:5966
Copyright: © EURECOM. Personal use of this material is permitted. The definitive version of this paper was published in Thesis and is available at :
Bibtex: @phdthesis{EURECOM+5966, year = {2019}, title = {{T}he high dimensionality factor of coded caching: {R}esolving bottlenecks one antenna at a time}, author = {{L}ampiris, {E}leftherios}, school = {{T}hesis}, month = {08}, url = {http://www.eurecom.fr/publication/5966} }
See also: