方冬,
吴广富,
重庆邮电大学通信与信息工程学院 重庆 400065
基金项目:重庆市科技重大主题专项重点示范项目(cstc2018jszx-cyztzxX0035),重庆市教委科学技术研究项目(KJQN201800642)
详细信息
作者简介:王茜竹:女,1975年生,教授级高级工程师,研究方向为LTE、物联网以及车联网等协议标准等
方冬:男,1993年生,硕士生,研究方向为5G无线通信技术
吴广富:男,1980年生,博士生,高级工程师,研究方向为5G物理层关键技术等
通讯作者:吴广富 wugf@cqupt.edu.cn
中图分类号:TN929.5计量
文章访问数:906
HTML全文浏览量:264
PDF下载量:45
被引次数:0
出版历程
收稿日期:2019-07-05
修回日期:2020-02-20
网络出版日期:2020-07-15
刊出日期:2020-09-27
Multi-User Detection Based on Sparsity Adaptive Matching Pursuit Compressive Sensing for Uplink Grant-free Non-Orthogonal Multiple Access
Qianzhu WANG,Dong FANG,
Guangfu WU,
School of Communication and Information Engineering, Chongqing University of Posts and Telecommunications, Chongqing 400065, China
Funds:The Chongqing of Science and Technology Bureau, (cstc2018jszx-cyztzxX0035), The Project of Science and Technology Research Program of Chongqing Education Commission (KJQN201800642)
摘要
摘要:免授权非正交多址接入技术(NOMA)结合多用户检测技术(MUD),能够满足大规模机器通信(mMTC)场景中的大连接量、低信令开销和低时延传输等需求。在基于压缩感知(CS)的MUD算法中,活跃用户数往往作为已知信息,而实际通信系统中很难准确估计。基于此,该文提出一种改进稀疏度自适应匹配的多用户算法(MSAMP-MUD)。该算法首先利用广义Dice系数匹配准则选择与残差最匹配的原子,更新用户支撑集;当残差能量接近噪声能量时,终止迭代,从而获得最终支持集;否则,采取上述准则更新用户支撑集,提高支撑集中活跃用户数估计精度。在迭代过程中,根据最近两次残差能量之比,选取不同的迭代步长,以降低检测迭代次数。仿真结果表明,所提算法与传统基于CS的MUD算法相比,误码率降低约9%,迭代次数减少约10%。
关键词:大规模机器通信/
免授权/
非正交多址/
压缩感知/
多用户检测
Abstract:Grant-free Non-Orthogonal Multiple Access (NOMA) combined with Multi-User Detection (MUD) technology can meet the requirements of large connection volume, low signaling overhead and low latency transmission in massive Machine Type Communications (mMTC) scenarios. In the MUD algorithm based on Compressed Sensing (CS), the number of active users is often used as known information, but it is difficult to accurately estimate in the actual communication system. Based on this, this paper proposes a multi-user algorithm (Modified Sparsity Adaptive Matching Pursuit MUD, MSAMP-MUP) to improve the adaptive matching of sparsity. Firstly, the algorithm uses the generalized Dice coefficient matching criterion to select the atom that best matches the residual, and updates the user support set. When the residual energy is close to the noise energy, the iteration is terminated to obtain the final support set; Otherwise, the above criteria are used to update the user support set, and the estimation accuracy of the active users in the support set is improved. In the iteration process, different iteration steps are selected according to the ratio of the last two residual energies, so as to reduce the number of detection iterations. The simulation results show that, compared with the traditional CS-based MUD algorithm, the proposed algorithm reduces the bit error rate by about 9% and the number of iterations by about 10%.
Key words:Massive Machine Type Communications (mMTC)/
Grant-free/
Non-Orthogonal Multiple Access (NOMA)/
Compressed Sensing (CS)/
Multi-User Detection (MUD)
PDF全文下载地址:
https://jeit.ac.cn/article/exportPdf?id=babe693a-2a4b-4645-90da-d677fbb760d6