English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We consider a cache-aided interference network which consists of a library of$N$ files, $K_T$ transmitters and $K_R$ receivers (users), each equipped with alocal cache of size $M_T$ and $M_R$ files respectively, and connected via adiscrete-time additive white Gaussian noise (AWGN) channel. Each receiverrequests an arbitrary file from the library. The objective is to design a cacheplacement without knowing the receivers' requests and a communication schemesuch that the sum Degrees of Freedom (sum-DoF) of the delivery is maximized.This network model with one-shot transmission was firstly investigated byNaderializadeh {\em et al.}, who proposed a scheme that achieves a one-shotsum-DoF of $\min\{\frac{{M_TK_T+K_RM_R}}{{N}}, K_R\}$, which is optimal withina constant of $2$. One of the biggest limitations of this scheme is therequirement of high subpacketization level. This paper attempts to design newalgorithms to reduce the file subpacketization in such a network withouthurting the sum-DoF. In particular, we propose a new approach for bothprefetching and linearly coded delivery based on a combinatorial design called{\em hypercube}. The proposed approach reduces the subpacketizationexponentially in terms of $K_R M/N$ and achieves the identical one-shot sum DoFwhen $\frac{M_TK_T+K_RM_R}{N} \leq K_R$.

Cache-aided Interference Management using Hypercube Combinatorial Cache  Design with Reduced Subpacketizations and Order Optimal Sum-Degrees of  Freedom