上行SCMA系统的动态子图检测算法  

A Dynamic Sub-graph Detection Algorithm for Uplink SCMA Systems

作　　者：申敏[1] 李佳 何云[1] SHEN Min;LI Jia;HE Yun(School of Telecommunications and Information Engineering,Chongqing University of Posts and Telecommunications,Chongqing 400065,China)

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

出　　处：《电讯技术》2019年第7期749-754,共6页Telecommunication Engineering

基　　金：国家科技重大专项(2018ZX03001026-002)

摘　　要：面对未来网络需求量的爆炸性增长,稀疏码多址接入(Sparse Code Multiple Access,SCMA)作为一种基于码本的非正交多址技术,在用户连接数、频谱效率和低时延都有很大的提升。由于码字的稀疏性,SCMA采用消息传递算法(Message Passing Algorithm,MPA)实现多用户检测,但是复杂度还是相对较高,以至于很难应用于实际系统。为了解决上述问题,提出了一种动态子图消息传递算法(Dynamic Sub-graph Message Passing Algorithm,DS-MPA)进行信号检测。DS-MPA利用剩余值来确定下一次迭代的子图,减少了资源节点的更新用户数量,达到了降低复杂度的目的。仿真结果显示算法性能几乎无损并且降低了1/3左右的复杂度。In the face of the explosive growth of network demand in the future,sparse code multiple access(SCMA),as a codebook based non-orthogonal multiple access technology,can greatly improve the number of user connections,spectrum efficiency and low delay.Because of the sparsity of the codeword,SCMA uses message passing algorithm(MPA) to implement multiuser detection,but the complexity is still relatively high so that it is difficulty to be applied in the actual system.In order to solve the above problems,a dynamic sub-graph message passing algorithm(DS-MPA) is proposed for signal detection.DS-MPA uses residual values to determine the next iteration sub-graph,thus reducing the number of users,updating the resource nodes,and achieving the goal of reducing complexity.The simulation results show that the performance of the proposed algorithm is almost lossless and the complexity is reduced about 1/3.

关 键 词：5G 稀疏码多址接入(SCMA) 消息传递算法(MPA) 动态子图检测 

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