One of the famous problems in communications was the so-called “PN” problem in the Broadcast Channel, which refers to the setting where a fixed set of users provide perfect Channel State Information (CSI) to the multi-antenna transmitter, whereas the remaining users only provide finiteprecision CSI or no CSI. The Degrees-of-Freedom (DoF) of that setting were recently derived by means of the Aligned Image Set approach. In this work, we resolve the cache-aided variant of this problem (i.e., the “PN” setting with side information) in the regime where the number of users providing perfect CSI is smaller or equal to the number of transmit antennas. In particular, we derive the optimal rate-memory trade-off under the assumption of uncoded placement, and characterize the same trade-off within a factor of 2.01 for general placement. The result proves that the “PN” impact remains similar even in the presence of side information, but also that the optimal trade-off is not achievable through serving independently the two sets of users.
Rate-memory trade-off for the cache-aided MISO broadcast channel with hybrid CSIT
ITW 2020, IEEE International Workshop on Information Theory, 11-15 April 2021, Riva del Garda, Italy (Virtual Conference)
Riva del Garda
Systèmes de Communication
© 2021 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.
PERMALINK : https://www.eurecom.fr/publication/6391