论文标题
干扰减法对大量MIMO的无赠款多重访问的影响
Impact of Interference Subtraction on Grant-Free Multiple Access with Massive MIMO
论文作者
论文摘要
高度可扩展的多个访问方案的设计是对未来大规模机器类型通信的发展的主要挑战，在这种情况下，必须确保可靠性和延迟约束对大量不协调的设备。在这种情况下，编码的随机访问（CRA）方案，该方案连续的干扰取消算法允许对经典随机访问协议进行大量改进，最近引起了人们日益增长的兴趣。可以通过将CRA与大量多重输入多重输出（MIMO）结合使用来获得令人印象深刻的性能。在本文中，我们对这些方案进行了分析，该方案着重于不完善的通道估计对连续干扰取消的影响。然后，基于分析，我们建议在大型MIMO系统中针对CRA的创新信号处理算法。
The design of highly scalable multiple access schemes is a main challenge in the evolution towards future massive machine-type communications, where reliability and latency constraints must be ensured to a large number of uncoordinated devices. In this scenario, coded random access (CRA) schemes, where successive interference cancellation algorithms allow large improvements with respect to classical random access protocols, have recently attracted an increasing interest. Impressive performance can be potentially obtained by combining CRA with massive multiple input multiple output (MIMO). In this paper we provide an analysis of such schemes focusing on the effects of imperfect channel estimation on successive interference cancellation. Based on the analysis we then propose an innovative signal processing algorithm for CRA in massive MIMO systems.
