Pilot Allocation Algorithm Based on K-means Clustering in Cell-Free Massive MIMO Systems

Yu Hao, Jin Xin, Wang Tao, Song Tao, Lv Yu-xiang, Wu Hao
{"title":"Pilot Allocation Algorithm Based on K-means Clustering in Cell-Free Massive MIMO Systems","authors":"Yu Hao, Jin Xin, Wang Tao, Song Tao, Lv Yu-xiang, Wu Hao","doi":"10.1109/ICCC51575.2020.9345177","DOIUrl":null,"url":null,"abstract":"In this letter, a pilot allocation algorithm based on K-means clustering is proposed for the cell-free massive MIMO systems. Firstly, to avoid the communication between users and “invalid” access points (APs), a user-centered virtual cell division is adopted. Users select AP according to the large-scale factor of the channel to form a specific AP set which serves the specific users. Then, K value is determined by combining multiple features and the initial centroid is selected to cluster users. Finally, based on the results of user clustering, users in the internal cluster are assigned to orthogonal pilots, and users in different clusters are reused pilots, which can avoid pilot contamination (PC) caused by pilot reusing among users from the space perspective. Simulation results show that the proposed algorithm can reduce channel estimation error and enhance system throughput.","PeriodicalId":386048,"journal":{"name":"2020 IEEE 6th International Conference on Computer and Communications (ICCC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 6th International Conference on Computer and Communications (ICCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCC51575.2020.9345177","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

In this letter, a pilot allocation algorithm based on K-means clustering is proposed for the cell-free massive MIMO systems. Firstly, to avoid the communication between users and “invalid” access points (APs), a user-centered virtual cell division is adopted. Users select AP according to the large-scale factor of the channel to form a specific AP set which serves the specific users. Then, K value is determined by combining multiple features and the initial centroid is selected to cluster users. Finally, based on the results of user clustering, users in the internal cluster are assigned to orthogonal pilots, and users in different clusters are reused pilots, which can avoid pilot contamination (PC) caused by pilot reusing among users from the space perspective. Simulation results show that the proposed algorithm can reduce channel estimation error and enhance system throughput.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
无小区大规模MIMO系统中基于k -均值聚类的导频分配算法
本文提出了一种基于k均值聚类的无小区大规模MIMO系统导频分配算法。首先,为了避免用户与“无效”接入点之间的通信,采用了以用户为中心的虚拟小区划分。用户根据信道的规模因素选择AP,形成特定的AP集,为特定的用户服务。然后,结合多个特征确定K值,选择初始质心对用户进行聚类。最后,根据用户聚类的结果,将内部簇内的用户分配到正交导频上,并将不同簇内的用户重用为导频,从空间角度避免了用户之间因导频重用而造成的导频污染(pilot pollution, PC)。仿真结果表明,该算法可以减小信道估计误差,提高系统吞吐量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Safe and Stable Timing Method over Air Interface Based on Multi-Base Station Cooperation Peak to Average Power Ratio (PAPR) Mitigation for Underwater Acoustic OFDM System by Using an Efficient Hybridization Technique Monocular Visual-Inertial Odometry Based on Point and Line Features Block Halftoning for Size-Invariant Visual Cryptography Based on Two-Dimensional Lattices Airborne STAP with Unknown Mutual Coupling for Coprime Sampling Structure
×
引用
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