[1]贾志豪,孙 君.基于动态因子图更新率的 SCMA 检测算法[J].计算机技术与发展,2022,32(01):123-127.[doi:10. 3969 / j. issn. 1673-629X. 2022. 01. 021]
　JIA Zhi-hao,SUN Jun.SCMA Detection Algorithm Based on Dynamic FactorGraph Update Rate[J].,2022,32(01):123-127.[doi:10. 3969 / j. issn. 1673-629X. 2022. 01. 021]
点击复制

基于动态因子图更新率的 SCMA 检测算法()
分享到：

《计算机技术与发展》[ISSN:1006-6977/CN:61-1281/TN]

卷:
32
期数:
2022年01期
页码:
123-127
栏目:
网络与安全
出版日期:
2022-01-10

文章信息/Info

Title:
SCMA Detection Algorithm Based on Dynamic FactorGraph Update Rate
文章编号:
1673-629X(2022)01-0123-05
作者:
贾志豪; 孙 君
南京邮电大学 通信与信息工程学院,江苏 南京 210003
Author(s):
JIA Zhi-hao; SUN Jun
School of Telecommunications and Information Engineering,Nanjing University ofPosts and Telecommunications,Nanjing 210003,China
关键词:
稀疏码分多址; 消息传递算法; 动态因子图; 更新率; 计算复杂度
Keywords:
sparse code multiple access; message passing algorithm; dynamic factor graph; update rate; computational complexity
分类号:
TP301. 6;TN929. 5
DOI:
10. 3969 / j. issn. 1673-629X. 2022. 01. 021
摘要:
稀疏码分多址系统(sparse code multiple access,SCMA) 作为一种码域的非正交多址技术,在相同时频资源条件下承载更多用户,能够满足 5G 通信的海量连接需求,但是接收端采用的消息传递算法( message passing algorithm,MPA) 存在复杂度较高等问题。 因此,该文提出了一种基于动态因子图更新率的消息传递算法( DFT-MPA) ,利用更新率衡量迭代前后因子图分支上信息的变化程度,选择收敛程度较高的分支加入收敛集合,通过减少迭代过程中更新分支的数目,降低了计算复杂度,当所有分支加入收敛集合或者达到最大迭代次数,则完成迭代输出译码。 仿真结果表明,该算法能够有效平衡系统复杂度与误码率性能,满足不同的场景需求。
Abstract:
As a non orthogonal multiple access technology in code domain,sparse code multiple access ( SCMA) can support more userconnections under the same time-frequency resources and can meet the mass connection requirements of 5G communication. However,the message passing algorithm ( MPA) adopted by the receiver has the problem of high complexity. Therefore,we propose a messagepassing algorithm based on update rate of dynamic factor graph ( DFT-MPA) . The update rate is used to measure the change degree ofinformation on the branches of the factor graph before and after iteration. The branches with higher convergence degree are selected tojoin the convergence set. By reducing the number of update branches in the iteration process,the computational complexity is reduced.When all branches join the convergence set or reach the maximum iteration rate,the iterative output decoding is completed. Simulationshows that the proposed algorithm can effectively balance the system complexity and BER performance,which meets the requirements ofdifferent scenarios.
更新日期/Last Update: 2022-01-10