Dynamic Multi-user Detection Scheme Based on CVA-SSAOMP Algorithm in Uplink Grant-Free NOMA

Jian Zhang, Shichao Bai, Lei Xu, Hongwei Zhang, Hong-yu Fang, Xiaohui Li
{"title":"Dynamic Multi-user Detection Scheme Based on CVA-SSAOMP Algorithm in Uplink Grant-Free NOMA","authors":"Jian Zhang, Shichao Bai, Lei Xu, Hongwei Zhang, Hong-yu Fang, Xiaohui Li","doi":"10.1109/ICCT46805.2019.8947210","DOIUrl":null,"url":null,"abstract":"In the uplink grant-free non-orthogonal multiple access (NOMA) scenario, since the active user at the sender has a structured sparsity transmission characteristic, the compressive sensing recovery algorithm is initially applied to the joint detection of the active user and the transmitted data. However, the existing compressive sensing recovery algorithms with unknown sparsity often require noise power or signal-to-noise ratio (SNR) as the priori conditions, which greatly reduces the algorithm adaptability in multi-user detection. Therefore, an algorithm based on cross validation aided structured sparsity adaptive orthogonal matching pursuit (CVA-SSAOMP) is proposed to realize multi-user detection in dynamic change communication scenario of channel state information (CSI). The proposed algorithm transforms the structured sparsity model into a block sparse model, and without the priori conditions above, the cross validation method in the field of statistics and machine learning is used to adaptively estimate the sparsity of active user through the residual update of cross validation. The simulation results show that, compared with the traditional orthogonal matching pursuit (OMP) algorithm, subspace pursuit (SP) algorithm and cross validation aided block sparsity adaptive subspace pursuit (CVA-BSASP) algorithm, the proposed algorithm can effectively improve the accurate estimation of the sparsity of active user and the performance of system bit error ratio (BER), and has the advantage of low-complexity.","PeriodicalId":306112,"journal":{"name":"2019 IEEE 19th International Conference on Communication Technology (ICCT)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 19th International Conference on Communication Technology (ICCT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCT46805.2019.8947210","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In the uplink grant-free non-orthogonal multiple access (NOMA) scenario, since the active user at the sender has a structured sparsity transmission characteristic, the compressive sensing recovery algorithm is initially applied to the joint detection of the active user and the transmitted data. However, the existing compressive sensing recovery algorithms with unknown sparsity often require noise power or signal-to-noise ratio (SNR) as the priori conditions, which greatly reduces the algorithm adaptability in multi-user detection. Therefore, an algorithm based on cross validation aided structured sparsity adaptive orthogonal matching pursuit (CVA-SSAOMP) is proposed to realize multi-user detection in dynamic change communication scenario of channel state information (CSI). The proposed algorithm transforms the structured sparsity model into a block sparse model, and without the priori conditions above, the cross validation method in the field of statistics and machine learning is used to adaptively estimate the sparsity of active user through the residual update of cross validation. The simulation results show that, compared with the traditional orthogonal matching pursuit (OMP) algorithm, subspace pursuit (SP) algorithm and cross validation aided block sparsity adaptive subspace pursuit (CVA-BSASP) algorithm, the proposed algorithm can effectively improve the accurate estimation of the sparsity of active user and the performance of system bit error ratio (BER), and has the advantage of low-complexity.
基于CVA-SSAOMP算法的上行无授权NOMA动态多用户检测方案
在上行链路无授权非正交多址(NOMA)场景中,由于发送端活跃用户具有结构化稀疏传输特性,最初将压缩感知恢复算法应用于活跃用户与传输数据的联合检测。然而,现有的稀疏度未知的压缩感知恢复算法往往需要噪声功率或信噪比(SNR)作为先验条件,这大大降低了算法在多用户检测中的适应性。为此,提出了一种基于交叉验证辅助结构化稀疏度自适应正交匹配追踪(CVA-SSAOMP)算法,用于实现信道状态信息动态变化通信场景下的多用户检测。该算法将结构化稀疏性模型转化为块稀疏性模型,在不具备上述先验条件的情况下,利用统计学和机器学习领域的交叉验证方法,通过交叉验证的残差更新自适应估计活跃用户的稀疏性。仿真结果表明,与传统的正交匹配追踪(OMP)算法、子空间追踪(SP)算法和交叉验证辅助块稀疏性自适应子空间追踪(CVA-BSASP)算法相比,所提出的算法能有效提高活跃用户稀疏性的准确估计和系统误码率(BER)的性能,并具有低复杂度的优点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信