# Two-Dimensional Multi-Access Coded Caching with Multiple Transmit Antennas

Source: [Two-Dimensional Multi-Access Coded Caching with Multiple Transmit Antennas](<https://www.sota2.com/research/paper/68fa5bbe1e209131ce9cb2a0>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T17:15:32.909Z

Authors: K. K. Krishnan Namboodiri, Elizabath Peter, B. Sundar Rajan

Published: 2024-05-04T14:50:27.000Z

## Abstract

This work introduces a multi-antenna coded caching problem in a two-dimensional multi-access network, where a server with $L$ transmit antennas and $N$ files communicates to $K\_1K\_2$ users, each with a single receive antenna, through a wireless broadcast link. The network consists of $K\_1K\_2$ cache nodes and $K\_1K\_2$ users. The cache nodes, each with capacity $M$, are placed on a rectangular grid with $K\_1$ rows and $K\_2$ columns, and the users are placed regularly on the square grid such that a user can access $r^2$ neighbouring caches in a cyclic wrap-around fashion. For a given cache memory $M$, the goal of the coded caching problem is to serve the user demands with a minimum delivery time. We propose a solution for the aforementioned coded caching problem by designing two arrays: a caching array and a delivery array. Further, we present two classes of caching and delivery arrays and obtain corresponding multi-access coded caching schemes. The first scheme achieves a normalized delivery time (NDT) $\\frac{K\_1K\_2(1-r^2\\frac{M}{N})}{L+K\_1K\_2\\frac{M}{N}}$. The second scheme achieves an NDT $\\frac{K\_1K\_2(1-r^2\\frac{M}{N})}{L+K\_1K\_2r^2\\frac{M}{N}}$ when $M/N=1/K\_1K\_2$ and $L=K\_1K\_2-r^2$, which is optimal under uncoded placement and one-shot delivery.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2405.02683>)

[PDF](<https://arxiv.org/pdf/2405.02683.pdf>)
