arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1909.09290cs.ITmath.IT
收藏

基于Massive MIMO的免授权大规模接入成功符号传输率分析与优化

Analysis and Optimization of Successful Symbol Transmission Rate for Grant-free Massive Access with Massive MIMO

Gang Chen, Ying Cui, Hei Victor Cheng, Feng Yang, Lianghui Ding

摘要:

免授权大规模接入是用于支持物联网(IoT)的大规模机器类型通信(mMTC)的重要技术。免授权大规模接入的两个重要特征是低复杂度设备和短分组数据传输,这使得传统的性能度量,可达到的速率,在这种情况下是不合适的。在这封信中,我们研究了大规模多输入多输出(MIMO)系统中的免授权大规模接入。我们考虑随机接入控制,并采用近似消息传递(AMP)的用户活动检测和信道估计的导频传输阶段和小相移键控(PSK)调制的数据传输阶段。我们提出了一个更合理的性能指标,即成功的符号传输率(SSTR),免授权的大规模接入。我们得到封闭形式的近似表达式的渐近SSTR的情况下,最大比合并(MRC)和迫零(ZF)波束形成在基站(BS),分别。我们还最大化的渐近SSTR的接入参数和导频长度。

英文摘要:

Grant-free massive access is an important technique for supporting massive machine-type communications (mMTC) for Internet-of-Things (IoT). Two important features in grant-free massive access are low-complexity devices and short-packet data transmission, making the traditional performance metric, achievable rate, unsuitable in this case. In this letter, we investigate grant-free massive access in a massive multiple-input multiple-output (MIMO) system. We consider random access control, and adopt approximate message passing (AMP) for user activity detection and channel estimation in the pilot transmission phase and small phase-shift-keying (PSK) modulation in the data transmission phase. We propose a more reasonable performance metric, namely successful symbol transmission rate (SSTR), for grant-free massive access. We obtain closed-form approximate expressions for the asymptotic SSTR in the cases of maximal ratio combining (MRC) and zero forcing (ZF) beamforming at the base station (BS), respectively. We also maximize the asymptotic SSTR with respect to the access parameter and pilot length.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑