Fundamental limits of cache-aided MIMO wireless networks

This is the latest version of this item.

Official URL: https://dx.doi.org/10.1109/TIT.2023.3242607

This paper studies the Multi-Input-Multi-Output (MIMO) interference networks with arbitrary number of transmitters and receivers, where both the transmitters and receivers are equipped with caches. The main goal is to design content placement and delivery schemes that minimize the worst case normalized delivery time (NDT). First, we propose a delivery scheme for the cache-aided Single-Input-Multiple-Output (SIMO) interference networks. Then, we obtain the achievable NDT of the cache-aided MIMO interference networks using the decomposition property of splitting each multi-antenna transmitter into multiple single antenna transmitters. Furthermore, we derive an information-theoretic bound on the optimal NDT of the cache-aided MIMO interference network. Analytical results show that the proposed scheme is within a multiplicative gap of 2 from the derived lower bound independent of all system parameters for any uncoded cache placement scheme. We also derive a novel delivery scheme for the cache-aided Multi-Input-Single-Output (MISO) interference network outperforming our proposed scheme for the cache-aided MIMO interference network. The numerical results show the superiority of our proposed scheme over the state-of-the-art schemes in the literature. Our results show that the coded caching gain has a more significant contribution in reducing the transmission latency than the spatial multiplexing gain. Our results indicate that the receive-antennas become more effective in reducing the NDT than the transmit-antennas in the presence of caches at the receiver-side. In addition, we show that increasing the number of transmit-antennas has a higher gain in reducing the NDT than adding more transmitters in the cache-aided MISO interference network.