Determinant based codebook search for correlated massive MIMO channels

Yasser Naguib Ahmed, Y. Fahmy
{"title":"Determinant based codebook search for correlated massive MIMO channels","authors":"Yasser Naguib Ahmed, Y. Fahmy","doi":"10.1109/JEC-ECC.2017.8305778","DOIUrl":null,"url":null,"abstract":"In this paper, we consider the complexity problem related to the selection of the optimal codeword matrix in large size codebooks used in massive MIMO systems. We propose a novel determinant based search method that makes use of the optimality of the statistical precoding in correlated MIMO channels. Codebook (CB) search complexity is reduced by focusing the search process to a smaller set of admissible codewords thus minimizing the computational complexity when performing the brute force scan for the best codeword. Simulation results show that our algorithm not only provides a good tradeoff between complexity reduction and performance, it also provides robustness against channel estimation errors in comparison to other hierarchal codebook search algorithms.","PeriodicalId":406498,"journal":{"name":"2017 Japan-Africa Conference on Electronics, Communications and Computers (JAC-ECC)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 Japan-Africa Conference on Electronics, Communications and Computers (JAC-ECC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/JEC-ECC.2017.8305778","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In this paper, we consider the complexity problem related to the selection of the optimal codeword matrix in large size codebooks used in massive MIMO systems. We propose a novel determinant based search method that makes use of the optimality of the statistical precoding in correlated MIMO channels. Codebook (CB) search complexity is reduced by focusing the search process to a smaller set of admissible codewords thus minimizing the computational complexity when performing the brute force scan for the best codeword. Simulation results show that our algorithm not only provides a good tradeoff between complexity reduction and performance, it also provides robustness against channel estimation errors in comparison to other hierarchal codebook search algorithms.
基于行列式的相关海量MIMO信道码本搜索
本文研究了大规模多输入多输出系统中大尺寸码本中最优码字矩阵选择的复杂性问题。我们提出了一种新的基于行列式的搜索方法,利用相关MIMO信道中统计预编码的最优性。通过将搜索过程集中在较小的可接受码字集上,从而在执行最佳码字的蛮力扫描时将计算复杂度降至最低,从而降低了码本(CB)搜索复杂度。仿真结果表明,与其他分层码本搜索算法相比,我们的算法不仅在降低复杂度和性能之间取得了很好的平衡,而且对信道估计误差具有鲁棒性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信