Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 49 tok/s
Gemini 2.5 Pro 53 tok/s Pro
GPT-5 Medium 19 tok/s Pro
GPT-5 High 16 tok/s Pro
GPT-4o 103 tok/s Pro
Kimi K2 172 tok/s Pro
GPT OSS 120B 472 tok/s Pro
Claude Sonnet 4 39 tok/s Pro
2000 character limit reached

Multi-Antenna Coded Caching for Multi-Access Networks with Cyclic Wrap-Around (2310.08894v3)

Published 13 Oct 2023 in cs.IT and math.IT

Abstract: 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 of $M/N \leq 1$. The cyclic wrap-around MACC network with a single antenna at the server has been a well-investigated topic, and several coded caching schemes and improved lower bounds on the performance are known 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 three constructions of caching and delivery arrays for different scenarios and obtain corresponding multi-antenna MACC schemes for the same. Two schemes resulting from the above constructions 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 that of an optimal multi-antenna scheme for a dedicated cache network having an identical number of users, and each user has a normalized cache size of $rM/N$. Further, as a special case, one of the proposed schemes subsumes an existing optimal MACC scheme for the single-antenna setting.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (14)
  1. J. Hachem, N. Karamchandani, and S. N. Diggavi, “Coded caching for multi-level popularity and access," IEEE Trans. Inf. Theory, vol. 63, no. 5, pp. 3108–3141, May 2017.
  2. Q. Yan, M. Cheng, X. Tang and Q. Chen, “On the placement delivery array design for centralized coded caching scheme," IEEE Trans. Inf. Theory, vol. 63, no. 9, pp. 5821–5833, Sept. 2017.
  3. M. Salehi, A. Tölli, and S. P. Shariatpanahi, “A multi-antenna coded caching scheme with linear subpacketization," in Proc. IEEE Int. Conf. Commun. (ICC), 2020, pp. 1–6.
  4. F. Brunero and P. Elia, “Fundamental limits of combinatorial multi-access caching," IEEE Trans. Inf. Theory, vol. 69, no. 2, pp. 1037–1056, Feb. 2023.
  5. K. K. K. Namboodiri and B. S. Rajan, “Multi-access coded caching with coded placement," in Proc. IEEE Wireless Commun. Netw. Conf. (WCNC), 2022, pp. 2274–2279.
  6. K. S. Reddy and N. Karamchandani, “Rate-memory trade-off for multi-access coded caching with uncoded placement," IEEE Trans. Commun., vol. 68, no. 6, pp. 3261–3274, June 2020.
  7. B. Serbetci, E. Parrinello, and P. Elia, “Multi-access coded caching: gains beyond cache-redundancy," in Proc. IEEE Inf. Theory Workshop (ITW), 2019, pp. 1–5.
  8. K. S. Reddy and N. Karamchandani, “Structured index coding problems and multi-access coded caching," in Proc. IEEE Inf. Theory Workshop (ITW), 2020, pp. 1–5.
  9. D. Katyal, P. N. Muralidhar, and B. S. Rajan, “Multi-access coded caching schemes from cross resolvable designs," IEEE Trans. Commun., vol. 69, no. 5, pp. 2997–3010, May 2021.
  10. P. N. Muralidhar, D. Katyal, and B. S. Rajan, “Maddah-Ali-Niesen scheme for multi-access coded caching," in Proc. IEEE Inf. Theory Workshop (ITW), 2021, pp. 1–6.
  11. K. K. K. Namboodiri and B. S. Rajan, “Combinatorial multi-access coded caching: improved rate-memory trade-off with coded placement," Available on arXiv: 2212.12686 [cs.IT], Dec. 2022.
  12. M. Wigger, R. Timo, and S. Shamai, “Complete interference mitigation through receiver-caching in Wyner’s networks," in Proc. IEEE Inf. Theory Workshop (ITW), 2016, pp. 335–339.
  13. K. K. K. Namboodiri, E. Peter, and B. S. Rajan, “Extended placement delivery arrays for multi-antenna coded caching scheme," in Proc. IEEE Int. Symp. Inf. Theory (ISIT), 2022, pp. 1518–1523.
  14. E. Lampiris, A. Bazco-Nogueras, and P. Elia, “Resolving the feedback bottleneck of multi-antenna coded caching," IEEE Trans. Inf. Theory, vol. 68, no. 4, pp. 2331–2348, Apr. 2022.
Citations (2)

Summary

We haven't generated a summary for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.