MC-CDMA and SCMA Performance and Complexity Comparison in Overloaded Scenarios

Celso Iwata Frison, Henry Ramiro Carvajal Mora, C. D. Almeida
{"title":"MC-CDMA and SCMA Performance and Complexity Comparison in Overloaded Scenarios","authors":"Celso Iwata Frison, Henry Ramiro Carvajal Mora, C. D. Almeida","doi":"10.1109/ColComCon.2019.8809157","DOIUrl":null,"url":null,"abstract":"In 5G wireless networks, the perspective of very large number of simultaneous connections is challenging. In this sense, an overloaded system is a basic scenario of 5G multiple access techniques, that is, the number of active users is greater than the number of system subcarriers. Some schemes of non-orthogonal multiple access (NOMA) have been proposed in the literature and, two of them are compared in this paper. These NOMA techniques are the multi-carrier code division multiple access (MC-CDMA) and sparse code multiple access (SCMA). The performance, in terms of the mean bit error rate, and the decoding complexity, in terms of number of mathematical operations are evaluated. In MC-CDMA, the multi-user maximum likelihood detector (MU-MLD) implemented via sphere decoding (SD) algorithm is considered, which is the optimum receiver, but with polynomially complexity. In SCMA, a near optimal receiver is used, named as message passing algorithm (MPA), which is based on the sum-product algorithm, whose complexity does not depend, directly, on the number of users. Monte Carlo simulations and theoretical expressions are used to compare both multiple access techniques in the uplink of a cellular scenario. Results show that, for an equivalent spectral efficiencies, MC-CDMA performs better than SCMA and SD algorithm is less complex than MPA.","PeriodicalId":447783,"journal":{"name":"2019 IEEE Colombian Conference on Communications and Computing (COLCOM)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE Colombian Conference on Communications and Computing (COLCOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ColComCon.2019.8809157","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

In 5G wireless networks, the perspective of very large number of simultaneous connections is challenging. In this sense, an overloaded system is a basic scenario of 5G multiple access techniques, that is, the number of active users is greater than the number of system subcarriers. Some schemes of non-orthogonal multiple access (NOMA) have been proposed in the literature and, two of them are compared in this paper. These NOMA techniques are the multi-carrier code division multiple access (MC-CDMA) and sparse code multiple access (SCMA). The performance, in terms of the mean bit error rate, and the decoding complexity, in terms of number of mathematical operations are evaluated. In MC-CDMA, the multi-user maximum likelihood detector (MU-MLD) implemented via sphere decoding (SD) algorithm is considered, which is the optimum receiver, but with polynomially complexity. In SCMA, a near optimal receiver is used, named as message passing algorithm (MPA), which is based on the sum-product algorithm, whose complexity does not depend, directly, on the number of users. Monte Carlo simulations and theoretical expressions are used to compare both multiple access techniques in the uplink of a cellular scenario. Results show that, for an equivalent spectral efficiencies, MC-CDMA performs better than SCMA and SD algorithm is less complex than MPA.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
过载场景下MC-CDMA与SCMA性能及复杂度比较
在5G无线网络中,大量同时连接的前景是具有挑战性的。从这个意义上说,过载系统是5G多址技术的基本场景,即活跃用户数大于系统子载波数量。文献中已经提出了几种非正交多址(NOMA)方案,本文对其中两种方案进行了比较。这些NOMA技术是多载波码分多址(MC-CDMA)和稀疏码多址(SCMA)。性能,在平均误码率方面,和解码的复杂性,在数学运算的数量方面进行了评估。在MC-CDMA中,考虑了通过球面解码(SD)算法实现的多用户最大似然检测器(MU-MLD),它是最优接收方,但具有多项式复杂度。在SCMA中,使用了一种近似最优的接收方,称为消息传递算法(MPA),该算法基于和积算法,其复杂度不直接依赖于用户数。蒙特卡罗模拟和理论表达式用于比较两种多址技术在蜂窝场景的上行链路。结果表明,在等效频谱效率下,MC-CDMA算法优于SCMA算法,SD算法比MPA算法简单。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
On the Bit Error Rate of OFDMA Employing Short Cyclic Prefix and Maximal Ratio Combining KNN, k-Means and Fuzzy c-Means for 16-QAM Demodulation in Coherent Optical Systems Development of an IR system as an alternative for VLC uplink An educational environment based on stuffed toy robots, mobile apps, and expert systems to provide support in the early development of children MC-CDMA and SCMA Performance and Complexity Comparison in Overloaded Scenarios
×
引用
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