A Serial Maximum-likelihood Detection Algorithm for Massive MIMO Systems

Jing Zeng, Jun Lin, Zhongfeng Wang
{"title":"A Serial Maximum-likelihood Detection Algorithm for Massive MIMO Systems","authors":"Jing Zeng, Jun Lin, Zhongfeng Wang","doi":"10.1109/newcas49341.2020.9159768","DOIUrl":null,"url":null,"abstract":"As an important part of massive Multi-Input Multi-Output (MIMO) technologies, signal detection has been studied in the literature in recent years. The detection complexity grows significantly as the number of antennas increases in the system. Maximum-likelihood (ML) has the optimal performance with the highest complexity, which is prohibitive for implementation. In this work, we propose a serial ML (SML) algorithm, which changes the way of detection from parallel multi-dimensional searching to serial single-dimensional searching to reduce detection complexity. Besides, we employ a valid initial value for the proposed algorithm to obtain a faster convergence. Based on the simulation results, for the system with 128 receive antennas, the proposed SML algorithm outperforms the Minimum Mean Square Error (MMSE) method under different numbers of users and modulation schemes. When achieving a similar performance, the complexity of serial ML is almost a half of that of low complexity Message Passing Detection algorithm in the system with 16QAM and 16 or 32 users. It is demonstrated that our proposed SML method is more suitable for signal detection when the system adopts low order modulation schemes and serves larger number of users.","PeriodicalId":135163,"journal":{"name":"2020 18th IEEE International New Circuits and Systems Conference (NEWCAS)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 18th IEEE International New Circuits and Systems Conference (NEWCAS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/newcas49341.2020.9159768","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

As an important part of massive Multi-Input Multi-Output (MIMO) technologies, signal detection has been studied in the literature in recent years. The detection complexity grows significantly as the number of antennas increases in the system. Maximum-likelihood (ML) has the optimal performance with the highest complexity, which is prohibitive for implementation. In this work, we propose a serial ML (SML) algorithm, which changes the way of detection from parallel multi-dimensional searching to serial single-dimensional searching to reduce detection complexity. Besides, we employ a valid initial value for the proposed algorithm to obtain a faster convergence. Based on the simulation results, for the system with 128 receive antennas, the proposed SML algorithm outperforms the Minimum Mean Square Error (MMSE) method under different numbers of users and modulation schemes. When achieving a similar performance, the complexity of serial ML is almost a half of that of low complexity Message Passing Detection algorithm in the system with 16QAM and 16 or 32 users. It is demonstrated that our proposed SML method is more suitable for signal detection when the system adopts low order modulation schemes and serves larger number of users.
大规模MIMO系统的串行最大似然检测算法
信号检测作为海量多输入多输出(MIMO)技术的重要组成部分,近年来得到了大量文献的研究。随着系统中天线数量的增加,检测复杂度显著增加。最大似然(ML)具有最优的性能和最高的复杂性,这是难以实现的。本文提出了一种串行ML (serial ML, SML)算法,该算法将检测方式从并行多维搜索改为串行单维搜索,从而降低了检测复杂度。此外,我们采用了一个有效的初始值,以获得更快的收敛速度。仿真结果表明,对于具有128个接收天线的系统,在不同用户数量和调制方案下,SML算法的性能优于最小均方误差(MMSE)方法。当达到相似的性能时,串行ML的复杂度几乎是低复杂度Message Passing Detection算法在16QAM和16或32个用户的系统中的一半。实验结果表明,当系统采用低阶调制方式,且服务用户数量较大时,本文提出的SML方法更适合于信号检测。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信