Placement Delivery Array for Cache-Aided MIMO Systems
Yifei Huang, Kai Wan, Minquan Cheng, Jinyan Wang, Giuseppe Caire

TL;DR
This paper introduces a new combinatorial structure called MIMO-PDA for cache-aided MIMO networks, achieving maximum sum-DoF with reduced subpacketization through novel constructions.
Contribution
The paper proposes the MIMO-PDA framework and two new schemes that attain maximum sum-DoF with significantly lower subpacketization levels.
Findings
Achieves the sum-DoF upper bound matching prior optimal results.
Provides a linear subpacketization scheme under certain parameters.
Offers an exponential subpacketization scheme with practical advantages.
Abstract
We consider a cache-aided multiple-input multiple-output (MIMO) network, where a server equipped with antennas and a library of equal-size files communicates with users, each equipped with antennas and a cache of size files, over a wireless interference channel. Each user requests an arbitrary file from the library. The goal is to design coded caching schemes that simultaneously achieve the maximum sum degrees of freedom (sum-DoF) and low subpacketization. In this paper, we first introduce a unified combinatorial structure, termed the MIMO placement delivery array (MIMO-PDA), which characterizes uncoded placement and one-shot zero-forcing delivery. By analyzing the combinatorial properties of MIMO-PDAs, we derive a sum-DoF upper bound of , where , which coincides with the optimal DoF characterization in prior…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCaching and Content Delivery · Advanced Data Storage Technologies · Mobile Ad Hoc Networks
