Skip to content
DraconiticResearch
Search Sources API
203,203 studies31 sourcesUpdated 37 min ago
PreprintCC BY 4.0arXiv

Low-Subpacketization MIMO Coded Caching with Flexible Stream Allocation

Abstract

Subpacketization remains a major obstacle to the practical deployment of coded caching (CC) in multi-antenna wireless networks. In this paper, we propose a low-complexity multiple-input multiple-output (MIMO) CC scheme that enables flexible delivery rate adaptation while substantially reducing subpacketization requirements. The proposed design employs a virtual broadcast-channel decomposition to align cache-profile placement with flexible MIMO stream elevation which extends the shared-cache model to multi-antenna receivers. This enables flexible selection of feasible user and stream configurations, thereby providing explicit control over the spatial multiplexing gain under linear decodability constraints. Analytical results show that the proposed framework can asymptotically approach the best-known achievable degrees of freedom (DoF) under linear decodability constraints while requiring orders-of-magnitude lower subpacketization than existing schemes. Numerical evaluations further demonstrate that this flexibility yields notable throughput improvements at practical signal-to-noise ratios.

Related

  1. Hotplug Coded Caching: Uncoded versus Row-Wise Coded Placements
    Daniela Tuninetti
    arXivPreprintCC BY 4.0Full textGeneral mathematicsarXiv
  2. The Exact Memory-Rate Tradeoff for Three-User Secure Coded Caching
    Han Fang, Nan Liu, Wei Kang
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  3. Secure Multi-Access Coded Caching: A Lifting Approach
    Han Fang, Qinyi Lu, Nan Liu +1
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  4. Heterogeneous Demand-Private Coded Caching: Exact Characterization for Two Users and Two Files
    Tati V D N Eswar, Jithin Ravi
    arXivPreprintCC BY 4.0Full textGeneral mathematicsarXiv
  5. Order-Optimal Coded Caching With File and Demand Privacy
    Han Fang, Nan Liu, Wei Kang
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
BibTeX
@misc{naseritehrani2026lowsubpacketization,
  title = {{Low-Subpacketization MIMO Coded Caching with Flexible Stream Allocation}},
  author = {Mohammad NaseriTehrani and MohammadJavad Salehi and Antti Tölli},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2606.01353},
  eprint = {2606.01353},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2606.01353},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Low-Subpacketization MIMO Coded Caching with Flexible Stream Allocation
AU  - Mohammad NaseriTehrani
AU  - MohammadJavad Salehi
AU  - Antti Tölli
PY  - 2026
DA  - 2026/10/03
PB  - arXiv
DO  - 10.48550/arxiv.2606.01353
UR  - https://arxiv.org/abs/2606.01353
AB  - Subpacketization remains a major obstacle to the practical deployment of coded caching (CC) in multi-antenna wireless networks. In this paper, we propose a low-complexity multiple-input multiple-output (MIMO) CC scheme that enables flexible delivery rate adaptation while substantially reducing subpacketization requirements. The proposed design employs a virtual broadcast-channel decomposition to align cache-profile placement with flexible MIMO stream elevation which extends the shared-cache model to multi-antenna receivers. This enables flexible selection of feasible user and stream configurations, thereby providing explicit control over the spatial multiplexing gain under linear decodability constraints. Analytical results show that the proposed framework can asymptotically approach the best-known achievable degrees of freedom (DoF) under linear decodability constraints while requiring orders-of-magnitude lower subpacketization than existing schemes. Numerical evaluations further demonstrate that this flexibility yields notable throughput improvements at practical signal-to-noise ratios.
ER  -