Reduced Complexity Multicast Beamforming and User Grouping for Multi-Antenna Coded Caching

Shanuka R. Gamaethige, H. Mahmoodi, M. Salehi, H. Suraweera, Antti Tölli
{"title":"Reduced Complexity Multicast Beamforming and User Grouping for Multi-Antenna Coded Caching","authors":"Shanuka R. Gamaethige, H. Mahmoodi, M. Salehi, H. Suraweera, Antti Tölli","doi":"10.1109/EuCNC/6GSummit58263.2023.10188253","DOIUrl":null,"url":null,"abstract":"A new user-grouping method for multi antenna coded caching (CC) is proposed, able to simultaneously exploit spatial multiplexing, multicasting, and global caching gains. The proposed scheme achieves the theoretical optimal sum degrees of freedom (DoF) and can be applied to networks with any number of users K, transmit antennas L, and global CC gain t. The proposed scheme comprises both multicast and unicast transmissions wherein a suitable combination of messages is chosen exploiting a tree diagram structure thus guaranteeing symmetric transmission of data for any given set of network parameters. The same structure also removes the successive interference cancellation requirement at the receivers, thus enabling a simple linear design for optimized beamformers. Moreover, even though the proposed scheme in general requires a larger subpacketization than the original single antenna CC scheme, for the particular case of $\\frac{t+L}{t+1}\\in \\mathbb{N}$, it works with exactly the same subpacketization value. Finally, the achievability of the proposed scheme is proven, and in the simulations, it is demonstrated that the complexity of the transmitter and receiver implementations can be greatly reduced with only a modest performance loss.","PeriodicalId":65870,"journal":{"name":"公共管理高层论坛","volume":"75 1","pages":"222-227"},"PeriodicalIF":0.0000,"publicationDate":"2023-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"公共管理高层论坛","FirstCategoryId":"96","ListUrlMain":"https://doi.org/10.1109/EuCNC/6GSummit58263.2023.10188253","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

A new user-grouping method for multi antenna coded caching (CC) is proposed, able to simultaneously exploit spatial multiplexing, multicasting, and global caching gains. The proposed scheme achieves the theoretical optimal sum degrees of freedom (DoF) and can be applied to networks with any number of users K, transmit antennas L, and global CC gain t. The proposed scheme comprises both multicast and unicast transmissions wherein a suitable combination of messages is chosen exploiting a tree diagram structure thus guaranteeing symmetric transmission of data for any given set of network parameters. The same structure also removes the successive interference cancellation requirement at the receivers, thus enabling a simple linear design for optimized beamformers. Moreover, even though the proposed scheme in general requires a larger subpacketization than the original single antenna CC scheme, for the particular case of $\frac{t+L}{t+1}\in \mathbb{N}$, it works with exactly the same subpacketization value. Finally, the achievability of the proposed scheme is proven, and in the simulations, it is demonstrated that the complexity of the transmitter and receiver implementations can be greatly reduced with only a modest performance loss.
基于多天线编码缓存的低复杂度组播波束形成和用户分组
提出了一种新的多天线编码缓存(CC)用户分组方法,能够同时利用空间复用、多播和全局缓存的优势。提出的方案实现了理论上最优的和自由度(DoF),可以应用于任意数量的用户K、发射天线L和全局CC增益t的网络。提出的方案包括多播和单播传输,其中利用树形图结构选择合适的消息组合,从而保证任何给定网络参数集的数据对称传输。同样的结构也消除了接收器的连续干扰消除要求,从而使优化波束形成器的简单线性设计成为可能。此外,尽管所提出的方案通常需要比原始单天线CC方案更大的子分组,但对于\frac{t+L}{t+1}\in \mathbb{N}$的特殊情况,它可以使用完全相同的子分组值。最后,通过仿真证明了该方案的可实现性,并且在性能损失不大的情况下,大大降低了发送端和接收端实现的复杂性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
385
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信