In massive machine-type communications (mMTC), grant-free access is a key enabler for a massive number of users to be connected to a base station with low signaling overhead and low latency. In this paper, a two-stage genetic algorithm (GA) is proposed to design a new set of user-specific, non-orthogonal, unimodular sequences for uplink grant-free access. The first-stage GA is to find a subsampling index set for a partial unitary matrix that can be approximated to an equiangular tight frame. Then in the second-stage GA, we try to find a sequence to be masked to each column of the partial unitary matrix, in order to reduce the peak-to-average power ratio of the resulting columns for multicarrier transmission. Finally, the masked columns of the matrix are proposed as new non-orthogonal sequences for uplink grant-free access. Simulation results demonstrate that the non-orthogonal sequences designed by our two-stage GA exhibit excellent performance for compressed sensing based joint activity detection and channel estimation in uplink grant-free access. Compared to algebraic design, this GA-based design can present a set of good non-orthogonal sequences of arbitrary length, which provides more flexibility for uplink grant-free access in mMTC.
翻译:在大规模机型通信(MMTC)中,无赠款访问是使大量用户能够连接到一个信号低的顶部和低悬浮的基站的关键手段。在本文中,建议采用两阶段基因算法(GA)来设计一套新的用户专用、非横向、单模量序列,用于上行无赠款访问。第一阶段的GA将找到一个用于部分单一矩阵的子抽样指数,该矩阵可以近似于一个矩形紧凑框架。然后在第二阶段的GA中,我们试图找到一个序列以部分单一矩阵的每列为遮盖,以便降低由此形成的多载传输列的峰至平均能量比率。最后,矩阵的蒙面列被提议为上行无赠款访问的新的非垂直序列。模拟结果显示,我们两阶段GA设计的非垂直矩阵在压缩基于压缩的联合活动探测和频道估算上端的无赠款访问中表现出色,从而提供了目前无赠款访问的任意访问顺序设计。比较了目前无赠款访问的磁带灵活性。