大规模MIMO的低复杂度线性预编码方法

Salah Berra, M. Albreem, M. Abed
{"title":"大规模MIMO的低复杂度线性预编码方法","authors":"Salah Berra, M. Albreem, M. Abed","doi":"10.1109/UCET51115.2020.9205420","DOIUrl":null,"url":null,"abstract":"In massive multiple-input multiple-output (MIMO), the base-station (BS) is equipped with tens or hundreds of antennas to serve many users. The demand for a low complexity precoding algorithm is significantly increased. Linear precoding schemes, such as zero-forcing (ZF), are capable to obtain a quasi-optimum performance when a favourable channel propagation occurs in downlink massive (MIMO) systems. Particularly, conventional linear precoding techniques require to calculate a matrix inverse which increases the expenses of computational complexity. In this paper, a low complexity linear precoder based on a hybrid acceleration overrelaxation (AOR) method is proposed. The optimal relaxation, acceleration parameters, and the initial solution are selected to achieve an attractive balance between the performance and the computational complexity. Numerical results show that the proposed algorithm has greatly reduced the complexity from $\\mathcal{O}(K^{3})$ to $\\mathcal{O}(K^{2})$ (where K is the number of users). It also outperforms the up-to-date algorithms.","PeriodicalId":163493,"journal":{"name":"2020 International Conference on UK-China Emerging Technologies (UCET)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"A Low Complexity Linear Precoding Method for Massive MIMO\",\"authors\":\"Salah Berra, M. Albreem, M. Abed\",\"doi\":\"10.1109/UCET51115.2020.9205420\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In massive multiple-input multiple-output (MIMO), the base-station (BS) is equipped with tens or hundreds of antennas to serve many users. The demand for a low complexity precoding algorithm is significantly increased. Linear precoding schemes, such as zero-forcing (ZF), are capable to obtain a quasi-optimum performance when a favourable channel propagation occurs in downlink massive (MIMO) systems. Particularly, conventional linear precoding techniques require to calculate a matrix inverse which increases the expenses of computational complexity. In this paper, a low complexity linear precoder based on a hybrid acceleration overrelaxation (AOR) method is proposed. The optimal relaxation, acceleration parameters, and the initial solution are selected to achieve an attractive balance between the performance and the computational complexity. Numerical results show that the proposed algorithm has greatly reduced the complexity from $\\\\mathcal{O}(K^{3})$ to $\\\\mathcal{O}(K^{2})$ (where K is the number of users). It also outperforms the up-to-date algorithms.\",\"PeriodicalId\":163493,\"journal\":{\"name\":\"2020 International Conference on UK-China Emerging Technologies (UCET)\",\"volume\":\"56 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 International Conference on UK-China Emerging Technologies (UCET)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/UCET51115.2020.9205420\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference on UK-China Emerging Technologies (UCET)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/UCET51115.2020.9205420","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

在大规模多输入多输出(MIMO)中,基站(BS)配备了数十或数百个天线来服务许多用户。对低复杂度预编码算法的需求显著增加。线性预编码方案,如零强迫(ZF),能够在下行链路大规模(MIMO)系统中获得有利的信道传播时获得准最佳性能。特别是传统的线性预编码技术需要计算矩阵逆,这增加了计算复杂度的开销。提出了一种基于混合加速超松弛(AOR)方法的低复杂度线性预编码器。选择最优松弛、加速度参数和初始解,以在性能和计算复杂度之间取得一个有吸引力的平衡。数值结果表明,该算法将复杂度从$\mathcal{O}(K^{3})$大大降低到$\mathcal{O}(K^{2})$ (K为用户数)。它也优于最新的算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Low Complexity Linear Precoding Method for Massive MIMO
In massive multiple-input multiple-output (MIMO), the base-station (BS) is equipped with tens or hundreds of antennas to serve many users. The demand for a low complexity precoding algorithm is significantly increased. Linear precoding schemes, such as zero-forcing (ZF), are capable to obtain a quasi-optimum performance when a favourable channel propagation occurs in downlink massive (MIMO) systems. Particularly, conventional linear precoding techniques require to calculate a matrix inverse which increases the expenses of computational complexity. In this paper, a low complexity linear precoder based on a hybrid acceleration overrelaxation (AOR) method is proposed. The optimal relaxation, acceleration parameters, and the initial solution are selected to achieve an attractive balance between the performance and the computational complexity. Numerical results show that the proposed algorithm has greatly reduced the complexity from $\mathcal{O}(K^{3})$ to $\mathcal{O}(K^{2})$ (where K is the number of users). It also outperforms the up-to-date algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Smart Wristband for Gesture Recognition Foldable, Eco-Friendly and Low-Cost Microfluidic Paper-Based Capacitive Droplet Sensor A Wearable Health Monitoring System A Novel Approach for Classifying Diabetes’ Patients Based on Imputation and Machine Learning Towards Holographic Beam-Forming Metasurface Technology for Next Generation CubeSats
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1