大规模MIMO系统中基于密度的聚类两阶段预编码方案

Ziyan Liu, H. Bai
{"title":"大规模MIMO系统中基于密度的聚类两阶段预编码方案","authors":"Ziyan Liu, H. Bai","doi":"10.1109/ICCSN.2019.8905345","DOIUrl":null,"url":null,"abstract":"We propose a density-based clustering two-stage precoding scheme to solve the problems of non-channel reciprocity and high complexity of precoding of downlink channels in an FDD Massive MIMO system. After dividing the users with equivalent of channel autocorrelation matrix into one group, we perform two-stage precoding for each group to reduce system overhead. The numerical results demonstrate that compared with the traditional linear precoding algorithm, the proposed scheme greatly reduces the complexity of the system, achieves higher system capacity and lower BER.","PeriodicalId":330766,"journal":{"name":"2019 IEEE 11th International Conference on Communication Software and Networks (ICCSN)","volume":"113 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Density-Based Clustering Two-Stage Precoding Scheme in Massive MIMO System\",\"authors\":\"Ziyan Liu, H. Bai\",\"doi\":\"10.1109/ICCSN.2019.8905345\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a density-based clustering two-stage precoding scheme to solve the problems of non-channel reciprocity and high complexity of precoding of downlink channels in an FDD Massive MIMO system. After dividing the users with equivalent of channel autocorrelation matrix into one group, we perform two-stage precoding for each group to reduce system overhead. The numerical results demonstrate that compared with the traditional linear precoding algorithm, the proposed scheme greatly reduces the complexity of the system, achieves higher system capacity and lower BER.\",\"PeriodicalId\":330766,\"journal\":{\"name\":\"2019 IEEE 11th International Conference on Communication Software and Networks (ICCSN)\",\"volume\":\"113 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE 11th International Conference on Communication Software and Networks (ICCSN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCSN.2019.8905345\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 11th International Conference on Communication Software and Networks (ICCSN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSN.2019.8905345","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

针对FDD大规模MIMO系统中下行信道的非信道互易性和预编码复杂度高的问题,提出了一种基于密度的聚类两阶段预编码方案。在将信道自相关矩阵等价的用户划分为一组后,我们对每一组进行两阶段预编码,以减少系统开销。数值结果表明,与传统的线性预编码算法相比,该方案大大降低了系统的复杂度,实现了更高的系统容量和更低的误码率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Density-Based Clustering Two-Stage Precoding Scheme in Massive MIMO System
We propose a density-based clustering two-stage precoding scheme to solve the problems of non-channel reciprocity and high complexity of precoding of downlink channels in an FDD Massive MIMO system. After dividing the users with equivalent of channel autocorrelation matrix into one group, we perform two-stage precoding for each group to reduce system overhead. The numerical results demonstrate that compared with the traditional linear precoding algorithm, the proposed scheme greatly reduces the complexity of the system, achieves higher system capacity and lower BER.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信