5,301 research outputs found
Delivery Time Minimization in Edge Caching: Synergistic Benefits of Subspace Alignment and Zero Forcing
An emerging trend of next generation communication systems is to provide
network edges with additional capabilities such as additional storage resources
in the form of caches to reduce file delivery latency. To investigate this
aspect, we study the fundamental limits of a cache-aided wireless network
consisting of one central base station, transceivers and receivers from
a latency-centric perspective. We use the normalized delivery time (NDT) to
capture the per-bit latency for the worst-case file request pattern at high
signal-to-noise ratios (SNR), normalized with respect to a reference
interference-free system with unlimited transceiver cache capabilities. For
various special cases with and that satisfy , we establish the optimal tradeoff between cache storage and latency. This
is facilitated through establishing a novel converse (for arbitrary and
) and an achievability scheme on the NDT. Our achievability scheme is a
synergistic combination of multicasting, zero-forcing beamforming and
interference alignment.Comment: submitted to ICC 2018; fixed some typo
Generalized Degrees of Freedom of the Symmetric Cache-Aided MISO Broadcast Channel with Partial CSIT
We consider the cache-aided MISO broadcast channel (BC) in which a
multi-antenna transmitter serves single-antenna receivers, each equipped
with a cache memory. The transmitter has access to partial knowledge of the
channel state information. For a symmetric setting, in terms of channel
strength levels, partial channel knowledge levels and cache sizes, we
characterize the generalized degrees of freedom (GDoF) up to a constant
multiplicative factor. The achievability scheme exploits the interplay between
spatial multiplexing gains and coded-multicasting gain. On the other hand, a
cut-set-based argument in conjunction with a GDoF outer bound for a parallel
MISO BC under channel uncertainty are used for the converse. We further show
that the characterized order-optimal GDoF is also attained in a decentralized
setting, where no coordination is required for content placement in the caches.Comment: first revisio
- …