A Parafac-Based Blind Channel Estimation and Symbol Detection Scheme for Massive MIMO Systems

Lingxiao Zhao, Shuangzhi Li, Jiankang Zhang, X. Mu
{"title":"A Parafac-Based Blind Channel Estimation and Symbol Detection Scheme for Massive MIMO Systems","authors":"Lingxiao Zhao, Shuangzhi Li, Jiankang Zhang, X. Mu","doi":"10.1109/CYBERC.2018.00069","DOIUrl":null,"url":null,"abstract":"In this paper, a multi-user massive multiple-input and multiple-output (MIMO) uplink system is considered, in which multiple single antenna users communicate with a target BS equipped with a large antenna array. We assume both the BS and K users have no knowledge of channel statement information. For such a system, by utilizing the unique factorization of three-way tensors, we proposed a parafac-based blind channel estimation and symbol detection scheme for the massive MIMO system, the proposed system can ensure the unique identification of the channel matrix and symbol matrix in a noise-free case. In a noisy case, a novel fitting algorithm called constrained bilinear alternating least squares is proposed to efficiently estimate the channel matrix and symbols. Numerical simulation results illustrate that the proposed scheme has a superior bit error ratio and normalized mean square error performance than traditional least square method. In addition, it has a faster convergence speed than typical alternation least square fitting algorithm.","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CYBERC.2018.00069","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In this paper, a multi-user massive multiple-input and multiple-output (MIMO) uplink system is considered, in which multiple single antenna users communicate with a target BS equipped with a large antenna array. We assume both the BS and K users have no knowledge of channel statement information. For such a system, by utilizing the unique factorization of three-way tensors, we proposed a parafac-based blind channel estimation and symbol detection scheme for the massive MIMO system, the proposed system can ensure the unique identification of the channel matrix and symbol matrix in a noise-free case. In a noisy case, a novel fitting algorithm called constrained bilinear alternating least squares is proposed to efficiently estimate the channel matrix and symbols. Numerical simulation results illustrate that the proposed scheme has a superior bit error ratio and normalized mean square error performance than traditional least square method. In addition, it has a faster convergence speed than typical alternation least square fitting algorithm.
一种基于parafac的大规模MIMO系统盲信道估计和符号检测方案
本文研究了一个多用户大规模多输入多输出(MIMO)上行系统,其中多个单天线用户与配备大型天线阵列的目标基站通信。我们假设BS和K用户都不知道通道语句信息。针对该系统,利用三向张量的唯一分解,提出了一种基于parafac的大规模MIMO系统盲信道估计和符号检测方案,该方案能够在无噪声情况下保证信道矩阵和符号矩阵的唯一识别。在噪声情况下,提出了一种新的拟合算法——约束双线性交替最小二乘,以有效地估计信道矩阵和信道符号。数值仿真结果表明,与传统的最小二乘法相比,该方法具有更好的误码率和归一化均方误差性能。与典型的交替最小二乘拟合算法相比,具有更快的收敛速度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信