Multi-Antenna Coded Content Delivery with Caching: A Low-Complexity Solution
share
We study downlink beamforming in a single-cell network with a multi-antenna base station (BS) serving cache-enabled users. Assuming a library of files with a common rate, we formulate the minimum transmit power with proactive caching and coded delivery as a non-convex optimization problem. This corresponds to a multiple multicast problem, to which a stationary solution can be efficiently obtained through successive convex approximation (SCA). However, the complexity of the problem grows exponentially with the number of subfiles delivered to each user in each time slot, which itself grows exponentially with the number of users. We introduce a low-complexity alternative through time-sharing that limits the number of subfiles received by a user in each time slot. We then consider the joint design of beamforming and content delivery with sparsity constraints to limit the number of subfiles received by a user in each time slot. Numerical simulations show that the low-complexity scheme has minimal performance gap to the one obtained via the joint problem with sparsity constraints, and outperforms the state-of-the-art results at all SNR and rate values with sufficient antennas. A lower bound on the achievable DoF of the low-complexity scheme is also derived to characterize its high SNR regime performance.
READ FULL TEXT