Metraipolis › archive › dc_52bb2c73a87d

Low-Latency Coded Tensor--Matrix Multiplication for Distributed Signal Processing Systems — arXiv:2609.30567

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.30567
License (as archived)
CC0-1.0
Archived
2026-10-08T04:19:08.604Z
SHA-256 of the archived text
e6c4713026f584a37f7a35484074f93e515291d4732fe2676e6ee9b6a6579750
Stable URL of this page
https://metraipolis.com/documento/dc_52bb2c73a87d

How to cite

Low-Latency Coded Tensor--Matrix Multiplication for Distributed Signal Processing Systems — arXiv:2609.30567 — arXiv (en), https://arxiv.org/abs/2609.30567 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_52bb2c73a87d (Metraipolis archive dc_52bb2c73a87d, sha256 e6c4713026f584a37f7a35484074f93e515291d4732fe2676e6ee9b6a6579750)
BibTeX
@misc{dc52bb2c73a87d,
  title = {Low-Latency Coded Tensor--Matrix Multiplication for Distributed Signal Processing Systems — arXiv:2609.30567},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.30567},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_52bb2c73a87d; sha256 e6c4713026f584a37f7a35484074f93e515291d4732fe2676e6ee9b6a6579750},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.30567. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Large-scale signal processing systems, including aeronautical and aerospace platforms, increasingly rely on tensor operations, whose distributed execution is constrained by communication, memory, and latency bottlenecks. In this paper, we propose a tensor-aware coded computation framework for distributed mode-1 tensor--matrix multiplication that operates directly on tensor subtensors, avoiding explicit unfolding and preserving multi-dimensional structure. For a fixed partitioning configuration, the proposed tensor-PolyDot scheme achieves the same recovery threshold, communication cost, worker-side computation, and memory requirements as conventional matrix-based PolyDot schemes. However, by leveraging multivariate encoding, it replaces high-degree univariate interpolation at the fusion node with structured low-dimensional decoding. This leads to a substantial reduction in decoding complexity and latency, without affecting any other system metric. Additionally, the tensor-based approach improves memory locality and enables parallel decoding across tensor modes, making it well-suited to modern hardware architectures. Numerical results show decoding speedups proportional to the tensor partitioning factor, reaching up to an order-of-magnitude improvement in practical settings. These advantages make the proposed framework particularly relevant to latency-critical aeronautical and aerospace distributed signal processing systems.

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-28 in eess.SP).
Categorie arXiv: Signal Processing (eess.SP).
Pagina del lavoro: https://arxiv.org/abs/2609.30567 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T03:49:53.448Z dalla pagina https://arxiv.org/catchup/eess.SP/2026-09-28?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).