# Centralized and Decentralized Cache-Aided Interference Management in Heterogeneous Parallel Channels

## TL;DR

This paper analyzes cache-aided interference management in a heterogeneous network with both perfect and no channel state information, providing near-optimal degrees-of-freedom characterizations for centralized and decentralized settings.

## Contribution

It introduces a unified framework for cache-aided interference management over heterogeneous channels and derives near-optimal DoF results for both centralized and decentralized scenarios.

## Key findings

- Optimal DoF within a factor of 2 for centralized case
- Optimal decentralized DoF within a factor of 3
- Extension of results to heterogeneous parallel channels

## Abstract

We consider the problem of cache-aided interference management in a network consisting of $K_{\mathrm{T}}$ single-antenna transmitters and $K_{\mathrm{R}}$ single-antenna receivers, where each node is equipped with a cache memory. Transmitters communicate with receivers over two heterogenous parallel subchannels: the P-subchannel for which transmitters have perfect instantaneous knowledge of the channel state, and the N-subchannel for which the transmitters have no knowledge of the instantaneous channel state. Under the assumptions of uncoded placement and separable one-shot linear delivery over the two subchannels, we characterize the optimal degrees-of-freedom (DoF) to within a constant multiplicative factor of $2$. We extend the result to a decentralized setting in which no coordination is required for content placement at the receivers. In this case, we characterize the optimal one-shot linear DoF to within a factor of $3$.