期刊文献+

一种稀疏度自适应的SIMO-NOMA系统多用户检测算法 被引量:1

A sparsity adaptive multi-user detection algorithm for SIMO-NOMA systerms
在线阅读 下载PDF
导出
摘要 非正交多址接入(NOMA)可以通过对资源的非交使用来提高频谱利用率,增加用户连接数,有望成为5G的关键技术之一。考虑基站端配备多根天线,针对上行免调度SIMO-NOMA系统中活跃用户数量未知的情况,提出了一种基于压缩感知的稀疏度自适应匹配追踪硬融合算法(SAMP-HFA)。所提算法主要包括三部分:首先利用传统的SAMP算法估计基站端每根天线上的用户活动情况,接着融合这些检测到的用户活动信息获得一个公共的活跃用户集合,最后利用该集合估计活跃用户的传输数据。仿真结果表明,随着天线数目的增加,所提算法的误码率性能显著提高。 Non-orthogonal multiple access(NOMA)can improve spectrum efficiency and support massive connectivity by the use of resources in non-orthogonal way,which is expected to become one of the key technologies of 5G.Considering the situation that the base station(BS)is equipped with multiple antennas,this paper proposes a compressive sensing(CS)based sparsity adaptive matching pursuit hard fusion algorithm(SAMP-HFA)to realize multi-user detection(MUD)for uplink grant-free single-input multiple-output non-orthogonal multiple access(SIMO-NOMA)systems where the number of active user is unknown.The proposed algorithm consists of three steps.Firstly,it detects the user activity information by conventional SAMP algorithm at each antenna,and then amalgamates the detected user activity information to obtain a common active user set.Finally,the users′data can be detected by the obtained active user set.The results show that the proposed SAMP-HFA demonstrates significant performance gain in terms of bit error rate(BER)with the number of antennas increases.
作者 赵晓娟 杨守义 张爱华 李晓宇 Zhao Xiaojuan;Yang Shouyi;Zhang Aihua;Li Xiaoyu(School of Information Engineering,Zhengzhou University,Zhengzhou 450001,China;School of Electronic and Information Engineering,Zhongyuan University of Technology,Zhengzhou 450007,China)
出处 《电子技术应用》 2019年第1期64-67,共4页 Application of Electronic Technique
基金 国家自然科学基金项目(U1604159 61501530) 河南省高等学校青年骨干教师培养计划项目(2015GGJS-191)
关键词 压缩感知 多用户检测 SIMO-NOMA 稀疏度自适应 硬融合 compressive sensing multi-user detection SIMO-NOMA sparsity adaptive hard fusion
  • 相关文献

同被引文献4

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部