利用经济高效的拓扑结构扩展无蜂窝大规模多输入多输出系统的随机几何分析

IF 3.7 3区 计算机科学 Q2 TELECOMMUNICATIONS
Jiajun Gao;Qi Zhang;Jun Zhang;Shi Jin
{"title":"利用经济高效的拓扑结构扩展无蜂窝大规模多输入多输出系统的随机几何分析","authors":"Jiajun Gao;Qi Zhang;Jun Zhang;Shi Jin","doi":"10.1109/LCOMM.2025.3540544","DOIUrl":null,"url":null,"abstract":"Cell-free massive multiple-input multiple-output (CF-mMIMO) has emerged as a prominent technology in the wireless communication due to its outstanding performance. However, the common star topology requires all access points (APs) connect to the central processing unit (CPU) through individual fronthauls, leading to high cost and difficult scalability. In this letter, we use a cost-efficient topology to scale up the CF-mMIMO system, which allows the new AP (NAP) to connect to the CPU through existing APs (EAPs), called chain topology. As the EAP needs to forward signals from NAPs to the CPU, we assume each EAP can connect only a limited number of NAPs. Utilizing stochastic geometry tools, closed-form expressions of fronthaul length for star and chain topology are derived, respectively. Based on them, we find that the chain topology can significantly reduce the system cost. Moreover, the benefits of the chain topology become increasingly evident as the system scales up.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 4","pages":"689-693"},"PeriodicalIF":3.7000,"publicationDate":"2025-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Stochastic-Geometry Analysis on Scaling Up Cell-Free Massive MIMO Systems With a Cost-Efficient Topology\",\"authors\":\"Jiajun Gao;Qi Zhang;Jun Zhang;Shi Jin\",\"doi\":\"10.1109/LCOMM.2025.3540544\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cell-free massive multiple-input multiple-output (CF-mMIMO) has emerged as a prominent technology in the wireless communication due to its outstanding performance. However, the common star topology requires all access points (APs) connect to the central processing unit (CPU) through individual fronthauls, leading to high cost and difficult scalability. In this letter, we use a cost-efficient topology to scale up the CF-mMIMO system, which allows the new AP (NAP) to connect to the CPU through existing APs (EAPs), called chain topology. As the EAP needs to forward signals from NAPs to the CPU, we assume each EAP can connect only a limited number of NAPs. Utilizing stochastic geometry tools, closed-form expressions of fronthaul length for star and chain topology are derived, respectively. Based on them, we find that the chain topology can significantly reduce the system cost. Moreover, the benefits of the chain topology become increasingly evident as the system scales up.\",\"PeriodicalId\":13197,\"journal\":{\"name\":\"IEEE Communications Letters\",\"volume\":\"29 4\",\"pages\":\"689-693\"},\"PeriodicalIF\":3.7000,\"publicationDate\":\"2025-02-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Communications Letters\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10879259/\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"TELECOMMUNICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Communications Letters","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10879259/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

无蜂窝大规模多输入多输出(CF-mMIMO)以其优异的性能成为无线通信领域的一项重要技术。然而,通用星型拓扑要求所有接入点(ap)通过单独的前路连接到中央处理单元(CPU),这导致成本高且难以扩展。在本文中,我们使用一种经济高效的拓扑来扩展CF-mMIMO系统,该拓扑允许新AP (NAP)通过现有AP (eap)连接到CPU,称为链式拓扑。由于EAP需要将来自nap的信号转发到CPU,我们假设每个EAP只能连接有限数量的nap。利用随机几何工具,分别导出了星型和链型拓扑的前传长度的封闭表达式。在此基础上,我们发现链式拓扑结构可以显著降低系统成本。此外,随着系统的扩展,链拓扑的好处变得越来越明显。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Stochastic-Geometry Analysis on Scaling Up Cell-Free Massive MIMO Systems With a Cost-Efficient Topology
Cell-free massive multiple-input multiple-output (CF-mMIMO) has emerged as a prominent technology in the wireless communication due to its outstanding performance. However, the common star topology requires all access points (APs) connect to the central processing unit (CPU) through individual fronthauls, leading to high cost and difficult scalability. In this letter, we use a cost-efficient topology to scale up the CF-mMIMO system, which allows the new AP (NAP) to connect to the CPU through existing APs (EAPs), called chain topology. As the EAP needs to forward signals from NAPs to the CPU, we assume each EAP can connect only a limited number of NAPs. Utilizing stochastic geometry tools, closed-form expressions of fronthaul length for star and chain topology are derived, respectively. Based on them, we find that the chain topology can significantly reduce the system cost. Moreover, the benefits of the chain topology become increasingly evident as the system scales up.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Communications Letters
IEEE Communications Letters 工程技术-电信学
CiteScore
8.10
自引率
7.30%
发文量
590
审稿时长
2.8 months
期刊介绍: The IEEE Communications Letters publishes short papers in a rapid publication cycle on advances in the state-of-the-art of communication over different media and channels including wire, underground, waveguide, optical fiber, and storage channels. Both theoretical contributions (including new techniques, concepts, and analyses) and practical contributions (including system experiments and prototypes, and new applications) are encouraged. This journal focuses on the physical layer and the link layer of communication systems.
×
引用
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学术官方微信