西安电子科技大学学报 ›› 2019, Vol. 46 ›› Issue (4): 80-86.doi: 10.19665/j.issn1001-2400.2019.04.012

• • 上一篇    下一篇

一种低复杂度SCMA多用户检测算法

朱翠涛,吴蓓   

  1. 中南民族大学 智能无线通信湖北省重点实验室,湖北 武汉 430074
  • 收稿日期:2019-02-03 出版日期:2019-08-20 发布日期:2019-08-15
  • 作者简介:朱翠涛(1967—),男,教授,博士,E-mail: cuitaozhu@mail.scuec.edu.cn.
  • 基金资助:
    国家自然科学基金(61671483);湖北省自然科学基金(2016CFA089)

Low-complexity multi-user detection algorithm for an SCMA system

ZHU Cuitao,WU Bei   

  1. Hubei Key Lab. of Intelligent Wireless Communications, South-Central Univ. for Nationalities,Wuhan 430074, China
  • Received:2019-02-03 Online:2019-08-20 Published:2019-08-15

摘要:

为了进一步降低稀疏码多址接入系统中多用户检测算法的复杂度,提出了一种基于部分资源块高斯近似的多用户检测算法。首先对资源块优势等级进行比较;然后选择译码优势等级高的 n 个资源块使用加权消息传递算法,剩下的资源块使用高斯近似消息传递算法。同时联合资源块和用户优势等级,在每次迭代后对译码优势等级较高的用户直接译码并剔除,使得后续每轮迭代的复杂度依次降低。仿真结果表明,通过合理选择资源块个数,可以在保证检测性能的同时,有效地降低检测复杂度。因此,提出的算法较好地实现了译码性能和复杂度之间的平衡。

关键词: 稀疏码多址接入, 消息传递算法, 资源块, 高斯近似

Abstract:

To further reduce the complexity of multi-user detection algorithm for a sparse code multiple access system, a multi-user detection algorithm applied Gaussian approximation based on partially resource nodes is proposed. We first compare the superiority levels of resource nodes, then selectresource nodes with higher superiority and apply the weighted message passing algorithm to those nodes. For the remaining resource nodes, the Gaussian approximation is performed. Meanwhile, we develop a method for combining the superiority levels of resource nodes and users, and directly decode and remove the users with a higher superiority level after each iteration, so the complexity of subsequent iteration is decreased gradually. Simulation results show that, by rationally selecting the resource nodes, the proposed algorithm can guarantee the detection performance and effectively reduce the detection complexity, thus achieving a better tradeoff between the decoding performance and complexity.

Key words: sparse code multiple access, message passing algorithm, resource nodes, Gaussian approximation

中图分类号: 

  • TN929.5