solidot新版网站常见问题,请点击这里查看。
消息
本文已被查看3786次
Degrees of Freedom of Interference Networks with Transmitter-Side Caches. (arXiv:1712.05957v1 [cs.IT])
来源于:arXiv
This paper studies cache-aided interference networks with arbitrary number of
transmitters and receivers, whereby each transmitter has a cache memory of
finite size. Each transmitter fills its cache memory from a content library of
files in the placement phase. In the subsequent delivery phase, each receiver
requests one of the library files, and the transmitters are responsible for
delivering the requested files from their caches to the receivers. The
objective is to design schemes for the placement and delivery phases to
maximize the sum degrees of freedom (sum-DoF) which expresses the capacity of
the interference network at the high signal-to-noise ratio regime. Our work
mainly focuses on a commonly used uncoded placement strategy. We provide an
information-theoretic bound on the sum-DoF for this placement strategy. We
demonstrate by an example that the derived bound is tighter than the bounds
existing in the literature for small cache sizes. We propose a novel delivery
scheme with 查看全文>>