Hybrid Pseudo-stationary Iterative Detection Algorithm for Uplink Massive MIMO Systems

Arijit Datta, Manish Mandloi, V. Bhatia
{"title":"Hybrid Pseudo-stationary Iterative Detection Algorithm for Uplink Massive MIMO Systems","authors":"Arijit Datta, Manish Mandloi, V. Bhatia","doi":"10.1109/ANTS.2018.8710096","DOIUrl":null,"url":null,"abstract":"Massive multiple-input multiple-output (MIMO) is a core technology for 5G and beyond systems. However, symbol detection in massive MIMO requires high complexity matrix inversions. To tackle this problem, a novel and robust low complexity hybrid algorithm (HA) is proposed for uplink symbol detection in massive MIMO systems with a large number of users. Proposed HA integrates two novel techniques; non-stationary Newton iteration (NSNI) and improved sequential Richardson iteration (ISRI), which are proposed in this paper. Newton iteration (NI) is a promising technique for approximate matrix inversion, however, in this paper, Newton iteration (NI) is realized as the stationary iterative method which uses constant step size for all iterations. Consequently, NI suffers from performance-complexity trade-off. To address this issue, NSNI is proposed, which utilizes non-stationary step size that changes at each iteration. Moreover, Richardson iteration is a simple but efficient algorithm for massive MIMO detection, however, RI suffers from intersymbol interference (ISI) which is a major reason for the low performance of RI when the number of users scales up in massive MIMO system. Hence, symbols are updated sequentially to extenuate ISI in RI. In addition, to further improve the performance of RI, optimal step sizes based on each symbol-index in RI are computed and hence, an improved stationary Richardson iteration (ISRI) is introduced. Finally, to further boost bit error rate (BER), NSNI and RI are integrated into pseudo-stationary iterative HA for low complexity symbol detection in massive MIMO systems. Simulation results validate low complexity, superior BER performance and robustness of proposed HA as compared to recently reported several massive MIMO detection techniques, under both perfect and imperfect channel state information at the receiver.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ANTS.2018.8710096","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Massive multiple-input multiple-output (MIMO) is a core technology for 5G and beyond systems. However, symbol detection in massive MIMO requires high complexity matrix inversions. To tackle this problem, a novel and robust low complexity hybrid algorithm (HA) is proposed for uplink symbol detection in massive MIMO systems with a large number of users. Proposed HA integrates two novel techniques; non-stationary Newton iteration (NSNI) and improved sequential Richardson iteration (ISRI), which are proposed in this paper. Newton iteration (NI) is a promising technique for approximate matrix inversion, however, in this paper, Newton iteration (NI) is realized as the stationary iterative method which uses constant step size for all iterations. Consequently, NI suffers from performance-complexity trade-off. To address this issue, NSNI is proposed, which utilizes non-stationary step size that changes at each iteration. Moreover, Richardson iteration is a simple but efficient algorithm for massive MIMO detection, however, RI suffers from intersymbol interference (ISI) which is a major reason for the low performance of RI when the number of users scales up in massive MIMO system. Hence, symbols are updated sequentially to extenuate ISI in RI. In addition, to further improve the performance of RI, optimal step sizes based on each symbol-index in RI are computed and hence, an improved stationary Richardson iteration (ISRI) is introduced. Finally, to further boost bit error rate (BER), NSNI and RI are integrated into pseudo-stationary iterative HA for low complexity symbol detection in massive MIMO systems. Simulation results validate low complexity, superior BER performance and robustness of proposed HA as compared to recently reported several massive MIMO detection techniques, under both perfect and imperfect channel state information at the receiver.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
上行海量MIMO系统的混合伪平稳迭代检测算法
大规模多输入多输出(MIMO)是5G及以后系统的核心技术。然而,大规模MIMO中的符号检测需要高复杂度的矩阵反演。为了解决这一问题,提出了一种新颖的、鲁棒的低复杂度混合算法(HA),用于具有大量用户的大规模MIMO系统的上行符号检测。本文提出的HA集成了两种新技术;本文提出了非平稳牛顿迭代(NSNI)和改进的顺序理查森迭代(ISRI)。牛顿迭代(NI)是一种很有前途的矩阵近似反演技术,但本文将牛顿迭代(NI)实现为对所有迭代采用恒定步长的平稳迭代方法。因此,NI遭受性能复杂性的权衡。为了解决这个问题,提出了NSNI,它利用了在每次迭代中变化的非平稳步长。此外,Richardson迭代是一种简单而有效的大规模MIMO检测算法,然而,在大规模MIMO系统中,当用户数量增加时,RI会受到码间干扰(ISI)的影响,这是导致RI性能下降的主要原因。因此,符号顺序更新以减轻RI中的ISI。此外,为了进一步提高RI的性能,计算了基于RI中每个符号索引的最优步长,从而引入了改进的平稳理查森迭代(ISRI)。最后,为了进一步提高误码率(BER),将NSNI和RI集成到伪平稳迭代HA中,用于大规模MIMO系统中的低复杂度符号检测。与最近报道的几种大规模MIMO检测技术相比,仿真结果验证了该方法在接收端完全和不完全信道状态信息下的低复杂度、优越的误码率性能和鲁棒性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Cost-Efficient Resource Sharing in Ethernet-based 5G Mobile Fronthaul Networks Investigation of an Enhanced Efficiency Class-E Power Amplifier with Input Wave Shaping Network Edge Assisted DASH Video Caching Mechanism for Multi-access Edge Computing CMNS: An Energy-Efficient Communication Scheme for Wireless Sensor Networks Fast algorithm for Blind Deinterleaving of a Block Interleaver using binary and non-binary Block codes in a telecommunication system
×
引用
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