基于动态消息调度的SCMA低复杂度检测算法  

Low complexity detection algorithm based on dynamic message scheduling for SCMA

作　　者：吉明明 郑建宏[1] Ji Mingming;Zheng Jianhong(School of Communication ＆ Information Engineering,Chongqing University of Posts ＆ Telecommunications,Chongqing 400065,Chin)

机构地区：[1]重庆邮电大学通信与信息工程学院,重庆400065

出　　处：《计算机应用研究》2018年第8期2489-2491,共3页Application Research of Computers

基　　金：国家科技重大专项资助项目(2016ZX03002010-003)

摘　　要：稀疏码多址接入(sparse code multiple access,SCMA)是第五代无线通信网络的一种竞争性的非正交多址技术。针对上行SCMA系统译码复杂度高的问题,提出一种基于节点剩余度的动态消息调度算法(residual MPA,RMPA)。在每一轮迭代更新中,动态选择具有最大剩余度的消息首先进行更新,不仅保证了最不可靠的消息首先更新,同时也加快了译码的收敛。仿真结果表明,所提出的算法性能优于基于串行策略的MPA,且能在译码性能和复杂度之间保持很好的平衡。Sparse code multiple access （SCMA） is a competitive non-orthogonal multiple access technology for fifth-generation wireless communication networks. Aiming at the high decoding complexity of uplink SCMA communication system, this paper proposed a residual message passing algorithm （RMPA）, which dynamically updated the message by using the greatest degree of redundancy in each iteration. The proposed scheme could not only ensure that the most unreliable messages were updated first, but also accelerated the convergence of the decoding. The simulation results show that the proposed algorithm is superior to the serial MPA, and it can maintain a good balance between complexity and decoding performance.

关 键 词：稀疏码多址接入 多用户检测 剩余度 动态消息调度 

分 类 号：TN929.5[电子电信—通信与信息系统]