基于加权分组串行调度改进的MPA算法  

Improved Group of Weight Variable Node Serial Scheduling MPA

作　　者：邓旭 朱立东[1] DENG Xu;ZHU Lidong(National Key Laboratory of Science and Technology on Communications,UESTC,Chengdu 611731,China)

机构地区：[1]电子科技大学通信抗干扰技术国家级重点实验室,四川成都611731

出　　处：《无线电通信技术》2022年第3期422-430,共9页Radio Communications Technology

基　　金：国家自然科学基金(61871422)。

摘　　要：随着卫星通信系统的广泛应用,传统的正交多址接入技术已经无法满足日益增长的数据信息和海量用户的连接要求,此时非正交多址接入(Non-Orthogonal Multiple Access,NOMA)技术中的稀疏码多址接入技术(Sparse Code Multiple Access,SCMA)成为研究的焦点。现有基于消息传递算法(Message Passing Algorithm,MPA)的SCMA系统多用户检测算法主要分为串行调度MPA算法和并行调度MPA算法,然而这些算法在降低算法复杂度上并不是最优的选择。为了进一步加快算法的收敛速度,在加权串行调度MPA算法(Weight Variable Node SS-MPA,WVN-SS-MPA)基础上,提出一种基于加权分组串行调度改进的MPA算法(Improved Group of WVN-MPA,IG-WVN-MPA),该算法可以通过降低迭代次数、码本大小和行重因子来加快收敛速度。仿真结果表明,所提出的IG-WVN-MPA算法可以在保证系统性能的同时,大幅度降低算法复杂度。With the wide application of satellite communication systems,traditional orthogonal multiple access technologies are unable to meet increasing data and connection requirements of massive users.At this time,as one of non-orthogonal multiple access technologies,sparse code multiple access(SCMA)has become the focus of research.Existing multi-user detection algorithms for SCMA systems based on Message Passing Algorithm(MPA)are mainly divided into serial scheduling MPA(SS-MPA)and parallel scheduling MPA(PS-MPA).However,these algorithms are not the optimal choice in reducing algorithm complexity.In order to further speed up the convergence speed of this algorithm,we propose an improved group of WVN-MPA(IG-WVN-MPA)algorithm.The new algorithm can speed up the convergence speed by reducing the number of iterations,the size of codebook and the line weight factor.Simulation results show that the proposed IG-WVN-MPA algorithm can greatly reduce the complexity of the algorithm while ensuring the system performance.

关 键 词：卫星通信系统 稀疏码多址接入 串行调度 并行调度 多用户检测 

分 类 号：TP929.5[自动化与计算机技术]