  This work presents a new way of exploiting non-uniform file popularity in
coded caching networks. Focusing on a fully-connected fully-interfering
wireless setting with multiple cache-enabled transmitters and receivers, we
show how non-uniform file popularity can be used very efficiently to accelerate
the impact of transmitter-side data redundancy on receiver-side coded caching.
This approach is motivated by the recent discovery that, under any realistic
file-size constraint, having content appear in multiple transmitters can in
fact dramatically boost the speed-up factor attributed to coded caching.
  We formulate an optimization problem that exploits file popularity to
optimize the placement of files at the transmitters. We then provide a proof
that reduces significantly the variable search space, and propose a new search
algorithm that solves the problem at hand. We also prove an analytical
performance upper bound, which is in fact met by our algorithm in the regime of
many receivers. Our work reflects the benefits of allocating higher cache
redundancy to more popular files, but also reflects a law of diminishing
returns where for example very popular files may in fact benefit from minimum
redundancy. In the end, this work reveals that in the context of coded caching,
employing multiple transmitters can be a catalyst in fully exploiting file
popularity, as it avoids various asymmetry complications that appear when file
popularity is used to alter the receiver-side cache placement.
