免授权随机接入中时间相关性辅助的用户活跃性检测算法
Temporal Correlation Assisted User Activity Detection Algorithm for Grant-Free Random Access
-
摘要: 大规模机器类通信(massive Machine Type Communications,mMTC)旨在实现海量的物联网设备通信,被广泛应用于工业自动化、智能交通、智慧城市、智慧医疗等领域。面对数量巨大的用户设备,基于授权的随机接入技术存在接入失败概率高和信令开销大的弊端。为了解决这些弊端,学术界和工业界提出了免授权随机接入(Grant-Free Random Access,GFRA)技术,此技术能够使活跃用户设备在发送导频序列后直接传输数据而无需等待基站授权。因此,在基于免授权接入的mMTC中,基站的一个关键任务是进行用户设备活跃性检测。而在实际场景中,用户设备往往在连续时隙上呈现活跃状态,即存在时间相关性。特别地,利用时间相关性的先验信息可以降低用户设备活跃性的错误检测概率。本文从该出发点提出一种基于最大后验(Maximum A Posteriori,MAP)概率的坐标下降算法。具体而言,该算法首先从最大后验概率的角度构建目标函数,并通过Markov链模拟连续时隙中的状态转移。其次,使用坐标下降法处理接收信号的协方差得到活跃用户设备集合。最后,对当前时隙的用户设备最可能发生的情况进行决策。仿真结果表明,相比经典的活跃用户检测算法,本文算法拥有更低的错误检测概率。并且,当导频序列长度较短及活跃用户数量增加时,仍能表现出较好的检测性能。此外,随着接收天线增多,本文算法相比经典算法的性能增益更显著。Abstract: The goal of massive Machine Type Communications (mMTC) is to enable communications among a large number of Internet of Things (IoT) devices, enabling the creation of intelligent systems in various fields, such as industrial automation and smart transportation. In the mMTCs, only a small fraction of devices need to be in an active state to communicate with the base station, while the rest remain in a dormant state to conserve energy. For such mMTCs, the traditional authorization-based random access techniques suffer from high access failure probabilities and high signaling overhead. To this end, the concept of grant-free random access (GFRA) has emerged, and it allows for direct data transmission without waiting for authorization after the active user devices send pilot sequences. In the mMTCs based on GFRA, a critical task for the base station is to perform user device activity detection. In practical scenarios, user devices probably remain active due to consecutive activations triggered by the same event, indicating a high degree of temporal correlation between a device’s state in the current time slot and the previous one. However, this feature is ignored by classical active user detection algorithms. Exploiting this temporal correlation as prior information can reduce the error probability in detecting user device activity. Starting from this perspective, a time-information-assisted user activity detection algorithm is proposed, and it is named the coordinate descent algorithm based on maximum a posteriori probability (MAP-CD). Specifically, the proposed algorithm begins by constructing the objective function related to user device activity detection from the perspective of maximum a posteriori probability and then expresses the state transitions in consecutive time slots using Markov chains. Next, the coordinate descent algorithm is employed to figure out the set of active user devices with the help of the covariance of received signals. Simulation results indicate that, compared with the state-of-the-art activity detection algorithms in mMTCs, the proposed MAP-CD algorithm exhibits lower error detection probabilities due to its exploitation of the temporal correlation in user activities. The MAP-CD algorithm maintains good performance, even with a short pilot sequence or an increased number of active users. Moreover, as the number of receiving antennas gradually increases, the MAP-CD algorithm also exhibits more significant performance gains.