上行SCMA场景下MPA、Log-MPA和MAX-Log-MPA性能研究

Wissal Ben Ameur, P. Mary, Marion Dumay, J. Hélard, J. Schwoerer
{"title":"上行SCMA场景下MPA、Log-MPA和MAX-Log-MPA性能研究","authors":"Wissal Ben Ameur, P. Mary, Marion Dumay, J. Hélard, J. Schwoerer","doi":"10.1109/ICT.2019.8798841","DOIUrl":null,"url":null,"abstract":"Sparse code multiple access (SCMA) is a promising non-orthogonal multiple access scheme in order to fulfill the stringent 5G use cases requirements. SCMA can be seen as an improvement of low density signature orthogonal frequency division multiple access that takes advantage of codes sparsity to yield users overload. Generally, SCMA is implemented with message passing algorithm (MPA) at the decoder to benefit from the strong iterative decoding performance. On the other hand, it suffers from high complexity due to the large number of involved exponential operations to compute the log likelihood ratio (LLR). Hence, simplified sub-optimal versions of MPA known as MAX-Log-MPA and Log-MPA were proposed in order to ensure a trade-off between system complexity and performance. This paper presents a comprehensive comparison between those three algorithms in Gaussian and fading channels and precisely explains algorithms performance through a study of the extrinsic information behavior.","PeriodicalId":127412,"journal":{"name":"2019 26th International Conference on Telecommunications (ICT)","volume":"91 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"29","resultStr":"{\"title\":\"Performance study of MPA, Log-MPA and MAX-Log-MPA for an uplink SCMA scenario\",\"authors\":\"Wissal Ben Ameur, P. Mary, Marion Dumay, J. Hélard, J. Schwoerer\",\"doi\":\"10.1109/ICT.2019.8798841\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Sparse code multiple access (SCMA) is a promising non-orthogonal multiple access scheme in order to fulfill the stringent 5G use cases requirements. SCMA can be seen as an improvement of low density signature orthogonal frequency division multiple access that takes advantage of codes sparsity to yield users overload. Generally, SCMA is implemented with message passing algorithm (MPA) at the decoder to benefit from the strong iterative decoding performance. On the other hand, it suffers from high complexity due to the large number of involved exponential operations to compute the log likelihood ratio (LLR). Hence, simplified sub-optimal versions of MPA known as MAX-Log-MPA and Log-MPA were proposed in order to ensure a trade-off between system complexity and performance. This paper presents a comprehensive comparison between those three algorithms in Gaussian and fading channels and precisely explains algorithms performance through a study of the extrinsic information behavior.\",\"PeriodicalId\":127412,\"journal\":{\"name\":\"2019 26th International Conference on Telecommunications (ICT)\",\"volume\":\"91 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-04-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"29\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 26th International Conference on Telecommunications (ICT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICT.2019.8798841\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 26th International Conference on Telecommunications (ICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICT.2019.8798841","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 29

摘要

稀疏码多址(SCMA)是一种很有前途的非正交多址方案,以满足严格的5G用例要求。SCMA可以看作是对低密度签名正交频分多址的改进,它利用了码的稀疏性来避免用户过载。通常,SCMA在解码器上使用消息传递算法(MPA)来实现,以获得较强的迭代解码性能。另一方面,由于对数似然比(LLR)的计算涉及大量的指数运算,因此具有较高的复杂性。因此,提出了简化的次优MPA版本,即MAX-Log-MPA和Log-MPA,以确保系统复杂性和性能之间的权衡。本文对这三种算法在高斯信道和衰落信道下的性能进行了全面的比较,并通过对外部信息行为的研究精确地解释了算法的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Performance study of MPA, Log-MPA and MAX-Log-MPA for an uplink SCMA scenario
Sparse code multiple access (SCMA) is a promising non-orthogonal multiple access scheme in order to fulfill the stringent 5G use cases requirements. SCMA can be seen as an improvement of low density signature orthogonal frequency division multiple access that takes advantage of codes sparsity to yield users overload. Generally, SCMA is implemented with message passing algorithm (MPA) at the decoder to benefit from the strong iterative decoding performance. On the other hand, it suffers from high complexity due to the large number of involved exponential operations to compute the log likelihood ratio (LLR). Hence, simplified sub-optimal versions of MPA known as MAX-Log-MPA and Log-MPA were proposed in order to ensure a trade-off between system complexity and performance. This paper presents a comprehensive comparison between those three algorithms in Gaussian and fading channels and precisely explains algorithms performance through a study of the extrinsic information behavior.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Dual-polarized Antennas Based Directional Modulation Scheme Sliding-Window Processing of Turbo Equalization for Partial Response Channels Feature fusion by using LBP, HOG, GIST descriptors and Canonical Correlation Analysis for face recognition Periodic Time Series Data Classification By Deep Neural Network SFDS: A Self-Feedback Detection System for DNS Hijacking Based on Multi-Protocol Cross Validation
×
引用
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