18 July 2023 in IEEE Transactions on Communications
This work addresses the multi-antenna coded caching problem where a server with L transmit antennas communicates to K users through a wireless broadcast link. In the problem setting, the server has a library of N files, and each user is equipped with a dedicated cache of capacity M . A novel solution for the multi-antenna coded caching problem is obtained by designing a combinatorial structure called an extended placement delivery array (EPDA). It is shown that the placement delivery arrays known for the centralized coded caching scheme are a special class of EPDAs with L = 1. Furthermore, three constructions of EPDAs are proposed for the settings: a) K = t + L , b) K = nt + ( n - 1) L ; L ≥ t, n ≥ 2, and c) K, L, t such that t + L ≤ K , where t = KM/N is an integer. The multi-antenna schemes resulting from the first two constructions achieve the optimal degrees of freedom (DoF) t + L with a subpacketization number -the number of subfiles into which a file is divided- K /gcd( K, t,L ), which is lower than the subpacketization number of the existing schemes. The scheme obtained from the third construction also achieves the optimal DoF with a subpacketization number ( K /γ ( t + L )/γ) ( t + L )/γ, where γ = gcd( K, t,L ).
13 May 2022 in IEEE Transactions on Communications
The multi-access variant of the coded caching problem with $N$ files, $K$ users and $K$ caches, where each user has access to $L$ neighbouring caches in a cyclic wrap-around manner, is considered. A cut-set based lower bound on the optimal rate-memory trade-off of the multi-access coded caching (MACC) scheme is derived. Furthermore, an improved lower bound on the optimal rate-memory trade-off of the MACC scheme is derived using non-cut-set arguments. The improved lower bound is tighter than the previously known lower bounds for the same setting. Further, for cache memory $M\leq {(N-K+L)}/{K}$ , an achievable scheme makes use of coded placement is presented. By matching with the improved lower bound, the scheme is shown to be optimal when $N\leq K$ . Also, lower bounds on the optimal rate-memory trade-off of the MACC scheme incorporating secure delivery and secrecy conditions are derived.
17 January 2024 in IEEE Transactions on Information Theory
This work considers the combinatorial multi-access coded caching problem introduced in the recent work by Muralidhar et al. (2021). The problem setting consists of a central server having a library of $N$ files and $C$ caches each with capacity $M$ . Each user in the system can access a unique set of $r < C$ caches, and there exist users corresponding to every distinct set of $r$ caches. Therefore, the number of users in the system is $\binom {C}{r}$ . For the aforementioned combinatorial multi-access setting, we propose a coded caching scheme with an MDS code-based coded placement. This novel placement technique helps to achieve a better rate in the delivery phase compared to the optimal scheme under uncoded placement when $M> N/C$ . For a lower memory regime, we present another scheme with coded placement, which outperforms the optimal scheme under uncoded placement if the number of files is no more than the number of users. Further, we derive an information-theoretic lower bound on the optimal rate-memory trade-off of the combinatorial multi-access coded caching scheme. In addition, using the derived lower bound, we show that the first scheme is optimal in the higher memory regime, and the second scheme is optimal if $N\leq \binom {C}{r}$ . Finally, we show that the performance of the first scheme is within a constant factor of the optimal performance, when $r=2$ .
29 March 2024 in IEEE Transactions on Communications
This work studies the coded caching problem in a setting where users can access a private cache of their own along with a shared cache. The setting consists of a server connected to a set of users, assisted by a smaller number of helper nodes that are equipped with their own storage. In addition to the helper caches, each user possesses a dedicated cache which is also used to prefetch file contents. Each helper cache can serve an arbitrary number of users, but each user gets served by only one helper cache. We consider two scenarios: (a) the server has no prior information about the user-to-helper cache association, and (b) the server knows the user-to-helper cache association at the placement phase itself. We design centralized coded caching schemes under uncoded placement for the above two settings. For case (b), we propose four schemes, and establish the optimality of certain schemes in specific memory regimes by deriving matching lower bounds. The fourth scheme, called as the composite scheme, appropriately partitions the file library and the cache memories between two other schemes in case (b) to minimize the rate by leveraging the advantages of both.
27 January 2025 in IEEE Transactions on Communications
This work explores a multiple transmit antenna setting in a multi-access coded caching (MACC) network where each user accesses more than one cache. A MACC network has K users and K caches, and each user has access to r < K consecutive caches in a cyclic wrap-around manner. There are L antennas at the server, and each cache has a normalized size M/N ≤ 1. The cyclic wrap-around MACC network with a single antenna at the server has been well-investigated, and several coded caching schemes and improved lower bounds on the performance are derived for the same. However, this MACC network has not yet been studied under multi-antenna settings in the coded caching literature. We study the multi-antenna MACC problem and propose a solution for the same by constructing a pair of arrays called caching and delivery arrays. We present four constructions of caching and delivery arrays for different scenarios and obtain corresponding multi-antenna MACC schemes. Three of the above schemes achieve optimal performance under uncoded placement and one-shot delivery. The optimality is shown by matching the performance of the multi-antenna MACC scheme to the optimal performance in a dedicated cache network having K users and normalized cache size rM/N. Further, as a special case, one of the proposed schemes subsumes an existing optimal MACC scheme for the single-antenna setting.
16 March 2026 in IEEE Communications Letters
This paper studies coded caching in a partially cooperative D2D network, where only a subset of users transmit, while all request files. We propose a novel coded caching scheme that operates at all feasible memory regimes, regardless of the number of non-transmitting users. Compared to all known schemes, the proposed scheme requires the least amount of information about non-transmitting users, and its delivery phase is independent of the identities of non-transmitting users, thereby reducing coordination overhead. We also derive a lower bound on the transmission load. Using this, the proposed scheme is shown to be optimal in the high-memory regime.