A Compressive Sensing Based Multi-user Detection Algorithm for SIMa-NOMA Systems

Xiaojuan Zhao, Shou-yi Yang, Aihua Zhang, Xiaoyu Li
{"title":"A Compressive Sensing Based Multi-user Detection Algorithm for SIMa-NOMA Systems","authors":"Xiaojuan Zhao, Shou-yi Yang, Aihua Zhang, Xiaoyu Li","doi":"10.1109/ISWCS.2018.8491213","DOIUrl":null,"url":null,"abstract":"Multi-User Detection (MUD) for uplink grant-free Non-orthogonal Multiple Access (NOMA) has received much attention recently. In this paper, we consider the scenario in which a Base Station (BS) is equipped with multiple antennas, and propose a Compressive Sensing-based Hard Fusion Algorithm (CS-HFA) to realize MUD. More explicitly, we detect the user activity information by a conventional CS algorithm at each antenna, and then amalgamate the detected user activity information to derive an active user set. Finally, we can use the obtained active user set to estimate the active users' data. The proposed CS- HFA with low complexity for uplink grant-free Single-Input Multiple-Output Non-Orthogonal Multiple Access (SIMO-NOMA) systems can achieve better BER performance than traditional CS-based MUD in the NOMA system with single antenna at the BS.","PeriodicalId":272951,"journal":{"name":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","volume":"134 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISWCS.2018.8491213","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Multi-User Detection (MUD) for uplink grant-free Non-orthogonal Multiple Access (NOMA) has received much attention recently. In this paper, we consider the scenario in which a Base Station (BS) is equipped with multiple antennas, and propose a Compressive Sensing-based Hard Fusion Algorithm (CS-HFA) to realize MUD. More explicitly, we detect the user activity information by a conventional CS algorithm at each antenna, and then amalgamate the detected user activity information to derive an active user set. Finally, we can use the obtained active user set to estimate the active users' data. The proposed CS- HFA with low complexity for uplink grant-free Single-Input Multiple-Output Non-Orthogonal Multiple Access (SIMO-NOMA) systems can achieve better BER performance than traditional CS-based MUD in the NOMA system with single antenna at the BS.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于压缩感知的SIMa-NOMA系统多用户检测算法
多用户检测(MUD)用于上行链路无授权非正交多址(NOMA)是近年来备受关注的问题。本文针对基站多天线场景,提出了一种基于压缩感知的硬融合算法(CS-HFA)来实现多天线融合。更明确地说,我们通过传统的CS算法在每个天线上检测用户活动信息,然后合并检测到的用户活动信息,得出一个活跃用户集。最后,我们可以使用得到的活跃用户集来估计活跃用户的数据。提出的用于上行链路无授权单输入多输出非正交多址(SIMO-NOMA)系统的低复杂度CS- HFA可以在单天线处的NOMA系统中获得比传统CS-based MUD更好的BER性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Impact of Selective Channels on Post-OFDM Waveforms for 5G Machine Type Communications Secure Power Allocation of Two-Way Relaying with an Untrusted Denoise-and-Forward Relay Joint Hybrid Precoding Based on Orthogonal Codebook in Millimeter Wave Systems Approximating Electromagnetic Exposure in Dense Indoor Environments Location-Aware Hypergraph Coloring Based Spectrum Allocation for D2D Communication
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1