Achievable DoF Bounds for Cache-Aided Asymmetric MIMO Communications
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911528348811264 |
|---|---|
| author | NaseriTehrani, Mohammad Salehi, MohammadJavad Tölli, Antti |
| author_facet | NaseriTehrani, Mohammad Salehi, MohammadJavad Tölli, Antti |
| contents | This is an extended journal version of the conference paper published in ISIT 2025; submitted to IEEE Transactions on Communications (TCOM). Integrating coded caching (CC) into multiple-input multiple-output (MIMO) communications significantly enhances the achievable degrees of freedom (DoF). This paper investigates a practical cache-aided asymmetric MIMO configuration with cache ratio $γ$, where a server with $L$ transmit antennas communicates with $K$ users. The users are partitioned into $J$ groups, and each user in group $j$ has $G_j$ receive antennas. We propose four content-aware MIMO-CC strategies: \emph{min-$G$} enforces symmetry using the smallest antenna count among users; \emph{Grouping} maximizes intra-subset spatial multiplexing gain at the expense of some global caching gain; \emph{Super-grouping} aggregates users into optimized \emph{min-$G$}-based super-sets with identical effective receive multiplexing gains before applying \emph{Grouping} across them; and \emph{Phantom} redistributes spatial resources assuming ``phantom'' antennas at the users to bridge the performance gains of \emph{min-$G$} and \emph{Grouping}. We develop these asymmetric strategies under three reference symmetric CC placement-delivery policies with guaranteed linear decodability: a DoF-optimal policy achieving the optimal single-shot DoF, and two closed-form policies, namely combinatorial and linear cyclic low-complexity constructions, with the cyclic policy attaining DoF performance close to the others in many operating regimes. Analytical and numerical results demonstrate significant DoF improvements across various system configurations, and that policy-strategy combinations offer flexible trade-offs between DoF and subpacketization complexity. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_18240 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Achievable DoF Bounds for Cache-Aided Asymmetric MIMO Communications NaseriTehrani, Mohammad Salehi, MohammadJavad Tölli, Antti Information Theory Signal Processing This is an extended journal version of the conference paper published in ISIT 2025; submitted to IEEE Transactions on Communications (TCOM). Integrating coded caching (CC) into multiple-input multiple-output (MIMO) communications significantly enhances the achievable degrees of freedom (DoF). This paper investigates a practical cache-aided asymmetric MIMO configuration with cache ratio $γ$, where a server with $L$ transmit antennas communicates with $K$ users. The users are partitioned into $J$ groups, and each user in group $j$ has $G_j$ receive antennas. We propose four content-aware MIMO-CC strategies: \emph{min-$G$} enforces symmetry using the smallest antenna count among users; \emph{Grouping} maximizes intra-subset spatial multiplexing gain at the expense of some global caching gain; \emph{Super-grouping} aggregates users into optimized \emph{min-$G$}-based super-sets with identical effective receive multiplexing gains before applying \emph{Grouping} across them; and \emph{Phantom} redistributes spatial resources assuming ``phantom'' antennas at the users to bridge the performance gains of \emph{min-$G$} and \emph{Grouping}. We develop these asymmetric strategies under three reference symmetric CC placement-delivery policies with guaranteed linear decodability: a DoF-optimal policy achieving the optimal single-shot DoF, and two closed-form policies, namely combinatorial and linear cyclic low-complexity constructions, with the cyclic policy attaining DoF performance close to the others in many operating regimes. Analytical and numerical results demonstrate significant DoF improvements across various system configurations, and that policy-strategy combinations offer flexible trade-offs between DoF and subpacketization complexity. |
| title | Achievable DoF Bounds for Cache-Aided Asymmetric MIMO Communications |
| topic | Information Theory Signal Processing |
| url | https://arxiv.org/abs/2603.18240 |