非对称大规模MIMO网络中的导频聚类

R. Mochaourab, Emil Björnson, M. Bengtsson
{"title":"非对称大规模MIMO网络中的导频聚类","authors":"R. Mochaourab, Emil Björnson, M. Bengtsson","doi":"10.1109/SPAWC.2015.7227034","DOIUrl":null,"url":null,"abstract":"We consider the uplink of a cellular massive MIMO network. Since the spectral efficiency of these networks is limited by pilot contamination, the pilot allocation across cells is of paramount importance. However, finding efficient pilot reuse patterns is non-trivial especially in practical asymmetric base station deployments. In this paper, we approach this problem using coalitional game theory. Each cell has its own unique pilots and can form coalitions with other cells to gain access to more pilots. We develop a low-complexity distributed algorithm and prove convergence to an individually stable coalition structure. Simulations reveal fast algorithmic convergence and substantial performance gains over one-cell coalitions and full pilot reuse.","PeriodicalId":211324,"journal":{"name":"2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Pilot clustering in asymmetric massive MIMO networks\",\"authors\":\"R. Mochaourab, Emil Björnson, M. Bengtsson\",\"doi\":\"10.1109/SPAWC.2015.7227034\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the uplink of a cellular massive MIMO network. Since the spectral efficiency of these networks is limited by pilot contamination, the pilot allocation across cells is of paramount importance. However, finding efficient pilot reuse patterns is non-trivial especially in practical asymmetric base station deployments. In this paper, we approach this problem using coalitional game theory. Each cell has its own unique pilots and can form coalitions with other cells to gain access to more pilots. We develop a low-complexity distributed algorithm and prove convergence to an individually stable coalition structure. Simulations reveal fast algorithmic convergence and substantial performance gains over one-cell coalitions and full pilot reuse.\",\"PeriodicalId\":211324,\"journal\":{\"name\":\"2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)\",\"volume\":\"47 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SPAWC.2015.7227034\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPAWC.2015.7227034","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

摘要

我们考虑蜂窝大规模MIMO网络的上行链路。由于这些网络的频谱效率受到导频污染的限制,因此跨小区的导频分配至关重要。然而,寻找有效的导频重用模式并非易事,尤其是在实际的非对称基站部署中。在本文中,我们使用联合博弈论来解决这个问题。每个细胞都有自己独特的飞行员,并可以与其他细胞组成联盟,以获得更多的飞行员。我们开发了一种低复杂度的分布式算法,并证明了收敛到一个独立稳定的联盟结构。仿真结果表明,与单细胞联盟和完全导频重用相比,算法收敛速度快,性能显著提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Pilot clustering in asymmetric massive MIMO networks
We consider the uplink of a cellular massive MIMO network. Since the spectral efficiency of these networks is limited by pilot contamination, the pilot allocation across cells is of paramount importance. However, finding efficient pilot reuse patterns is non-trivial especially in practical asymmetric base station deployments. In this paper, we approach this problem using coalitional game theory. Each cell has its own unique pilots and can form coalitions with other cells to gain access to more pilots. We develop a low-complexity distributed algorithm and prove convergence to an individually stable coalition structure. Simulations reveal fast algorithmic convergence and substantial performance gains over one-cell coalitions and full pilot reuse.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信