基于Gram-Schmidt共轭方向法的大规模MIMO系统低复杂度预编码器

J. Minango, A. Flores, Pablo Minango, D. Ibarra
{"title":"基于Gram-Schmidt共轭方向法的大规模MIMO系统低复杂度预编码器","authors":"J. Minango, A. Flores, Pablo Minango, D. Ibarra","doi":"10.1109/ETCM.2018.8580269","DOIUrl":null,"url":null,"abstract":"In massive multiple-input multiple-output (MIMO) systems, when the number of base station (BS) antennas is much higher than the number of users. Linear zero-forcing (ZF) precoder is able to achieve the near-optimal capacity performance, once the massive MIMO channel matrix presents the property of asymptotic orthogonality. However, ZF precoder involves large matrix inversion with high complexity, especially when the number of users increases. In this paper, in order to avoid the habitual matrix inversion, we propose a novel low-complexity near-optimal precoder based on the Gram-Schmidt conjugate direction (GSCD) iterative method, which reduces the complexity from O(K3) to O(K2), where K is the number of users. Besides, a simple approach to determine the convergence rate achieved by GSCD-based precoder is obtained by exploiting the massive MIMO channel property of asymptotic orthogonality, which reveals that the proposed precoder converges faster with the increasing number of BS antennas. Numerical results reveal that GSCD-based precoder achieves the near-optimal capacity of the ZF precoder with a reduced number of iterations.","PeriodicalId":334574,"journal":{"name":"2018 IEEE Third Ecuador Technical Chapters Meeting (ETCM)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Low-Complexity Precoder for Massive MIMO Systems Based on Gram-Schmidt Conjugate Direction Method\",\"authors\":\"J. Minango, A. Flores, Pablo Minango, D. Ibarra\",\"doi\":\"10.1109/ETCM.2018.8580269\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In massive multiple-input multiple-output (MIMO) systems, when the number of base station (BS) antennas is much higher than the number of users. Linear zero-forcing (ZF) precoder is able to achieve the near-optimal capacity performance, once the massive MIMO channel matrix presents the property of asymptotic orthogonality. However, ZF precoder involves large matrix inversion with high complexity, especially when the number of users increases. In this paper, in order to avoid the habitual matrix inversion, we propose a novel low-complexity near-optimal precoder based on the Gram-Schmidt conjugate direction (GSCD) iterative method, which reduces the complexity from O(K3) to O(K2), where K is the number of users. Besides, a simple approach to determine the convergence rate achieved by GSCD-based precoder is obtained by exploiting the massive MIMO channel property of asymptotic orthogonality, which reveals that the proposed precoder converges faster with the increasing number of BS antennas. Numerical results reveal that GSCD-based precoder achieves the near-optimal capacity of the ZF precoder with a reduced number of iterations.\",\"PeriodicalId\":334574,\"journal\":{\"name\":\"2018 IEEE Third Ecuador Technical Chapters Meeting (ETCM)\",\"volume\":\"102 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE Third Ecuador Technical Chapters Meeting (ETCM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ETCM.2018.8580269\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Third Ecuador Technical Chapters Meeting (ETCM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ETCM.2018.8580269","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在大规模多输入多输出(MIMO)系统中,基站(BS)天线数量远远大于用户数量。当海量MIMO信道矩阵呈现渐近正交性时,线性零强迫(ZF)预编码器能够获得接近最优的容量性能。然而,ZF预编码器涉及大矩阵反演,复杂度高,特别是当用户数量增加时。为了避免惯性矩阵反演,本文提出了一种基于Gram-Schmidt共轭方向(GSCD)迭代法的新型低复杂度近最优预编码器,将复杂度从0 (K3)降低到O(K2),其中K为用户数。此外,利用海量MIMO信道渐近正交的特性,给出了一种确定基于gscd的预编码器收敛速率的简单方法,表明该预编码器随着BS天线数量的增加收敛速度更快。数值结果表明,基于gscd的预编码器在减少迭代次数的同时达到了ZF预编码器的近乎最优容量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Low-Complexity Precoder for Massive MIMO Systems Based on Gram-Schmidt Conjugate Direction Method
In massive multiple-input multiple-output (MIMO) systems, when the number of base station (BS) antennas is much higher than the number of users. Linear zero-forcing (ZF) precoder is able to achieve the near-optimal capacity performance, once the massive MIMO channel matrix presents the property of asymptotic orthogonality. However, ZF precoder involves large matrix inversion with high complexity, especially when the number of users increases. In this paper, in order to avoid the habitual matrix inversion, we propose a novel low-complexity near-optimal precoder based on the Gram-Schmidt conjugate direction (GSCD) iterative method, which reduces the complexity from O(K3) to O(K2), where K is the number of users. Besides, a simple approach to determine the convergence rate achieved by GSCD-based precoder is obtained by exploiting the massive MIMO channel property of asymptotic orthogonality, which reveals that the proposed precoder converges faster with the increasing number of BS antennas. Numerical results reveal that GSCD-based precoder achieves the near-optimal capacity of the ZF precoder with a reduced number of iterations.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信