.png){kind=icon}
返回
Stochastic Geometry Design for Cell-Free Coded Random Access
.png){kind=icon}
OA
AI
DOI：10.1109/LCOMM.2024.3420110.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Grant-free access schemes, capable to reduce control signaling and device complexity, are good candidates to support future massive multiple access applications. In the same direction, cell-free architectures promise to pave the way to fairness in power consumption and performance among the users. The combination of these two ingredients has the potential to interconnect a large number of low-power devices to the network. In this letter, a theoretical analysis tool for grant-free coded random access, based on stochastic geometry and density evolution, is developed in the context of cell-free architectures. In sharp contrast with the cell-based scenario, we found out that temporally repeating less packets is a valid option due to the exploitation of spatial repetitions given by the cell-free topology.
Keyword:
Cell-free massive MIMO
coded random access
density evolution
grant-free access
stochastic geometry
Cell-free massive MIMO
coded random access
density evolution
grant-free access
stochastic geometry
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
引用论文
.png){kind=icon}
查看更多内容