A Low-Complexity Soft-Output Signal Data Detection Algorithm for UL Massive MIMO Systems

Salah Berra, M. Albreem, Maha Malek, R. Dinis, Xingwang Li, Khaled Maaiuf Rabie
{"title":"A Low-Complexity Soft-Output Signal Data Detection Algorithm for UL Massive MIMO Systems","authors":"Salah Berra, M. Albreem, Maha Malek, R. Dinis, Xingwang Li, Khaled Maaiuf Rabie","doi":"10.1109/cits52676.2021.9618605","DOIUrl":null,"url":null,"abstract":"In massive multiple-input multiple-output (MIMO) systems, although the performance of maximum likelihood (ML) is the optimum, it introduces extremely high computational complexity, while minimum mean square error (MMSE) receivers can achieve quasi-optimal performance. Unfortunately, it requires a matrix inverse which increases the computational complexity in high loaded environments. Several methods have been proposed to avoid the matrix inversion such as the accelerated over relaxation (AOR). In the AOR algorithm, the initial solution and the optimum parameters have a great impact on the performance, computational complexity, and the convergence rate. In this paper, a detector based on AOR and a stair matrix is proposed to iteratively avoid the inverse of equalization matrix and expediting the convergence rate. In order to obtain high performance and low complexity, suitable schemes for the selection relaxation and acceleration parameters are also proposed. Numerical results show that the computational complexity of the proposed AOR approach is dramatically reduced from $\\mathcal{O}\\left( {{K^3}} \\right)$ to $\\mathcal{O}\\left( {{K^2}} \\right)$ where K is the number of users. It is also shown that the proposed detection algorithm outperforms the Neumann series method and achieves a quasi-optimal performance with a relatively small number of iterations.","PeriodicalId":211570,"journal":{"name":"2021 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Conference on Computer, Information and Telecommunication Systems (CITS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/cits52676.2021.9618605","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

In massive multiple-input multiple-output (MIMO) systems, although the performance of maximum likelihood (ML) is the optimum, it introduces extremely high computational complexity, while minimum mean square error (MMSE) receivers can achieve quasi-optimal performance. Unfortunately, it requires a matrix inverse which increases the computational complexity in high loaded environments. Several methods have been proposed to avoid the matrix inversion such as the accelerated over relaxation (AOR). In the AOR algorithm, the initial solution and the optimum parameters have a great impact on the performance, computational complexity, and the convergence rate. In this paper, a detector based on AOR and a stair matrix is proposed to iteratively avoid the inverse of equalization matrix and expediting the convergence rate. In order to obtain high performance and low complexity, suitable schemes for the selection relaxation and acceleration parameters are also proposed. Numerical results show that the computational complexity of the proposed AOR approach is dramatically reduced from $\mathcal{O}\left( {{K^3}} \right)$ to $\mathcal{O}\left( {{K^2}} \right)$ where K is the number of users. It is also shown that the proposed detection algorithm outperforms the Neumann series method and achieves a quasi-optimal performance with a relatively small number of iterations.
UL大规模MIMO系统的低复杂度软输出信号数据检测算法
在大规模多输入多输出(MIMO)系统中,虽然最大似然(ML)的性能是最优的,但它引入了极高的计算复杂度,而最小均方误差(MMSE)接收器可以达到准最优的性能。不幸的是,它需要一个矩阵逆,这增加了高负载环境下的计算复杂度。为了避免矩阵反演,提出了几种方法,如加速过松弛法(AOR)。在AOR算法中,初始解和最优参数对算法性能、计算复杂度和收敛速度有很大影响。本文提出了一种基于AOR和阶梯矩阵的检测器,迭代地避免了均衡矩阵的逆,加快了收敛速度。为了获得高性能和低复杂度,还提出了合适的松弛和加速参数选择方案。数值结果表明,本文提出的AOR方法的计算复杂度从$\mathcal{O}\left({{K^3}} \right)$显著降低到$\mathcal{O}\left({{K^2}} \right)$,其中K为用户数量。结果表明,该检测算法优于诺伊曼级数方法,迭代次数相对较少,达到了准最优性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信