Low complexity sparse code multiple access decoder based on tree pruned method

Jienan Chen, Kaining Han, Jianhao Hu, Zhenbing Zhang
{"title":"Low complexity sparse code multiple access decoder based on tree pruned method","authors":"Jienan Chen, Kaining Han, Jianhao Hu, Zhenbing Zhang","doi":"10.1109/ICDSP.2016.7868575","DOIUrl":null,"url":null,"abstract":"With the requirement of rapid traffic growth and tremendous access, non-orthogonal multiple access becoming a prominent technology in the current 5G research area. The sparse code multiple access (SCMA) scheme is one of the most promising technology among the non-orthogonal technologies. In this work, we propose a tree pruned method based on MAX log-message decoding algorithm (MPA) to reduce the decoding complexity of SCMA significantly. We first formulate the decoding problem to a tree updating process. By using the tree pruned method, the sub nodes with lower weight can be updated by low complexity arithmetic operations. According to the simulation result, the proposed tree pruned method reduces 30% computation complexity compared with existing methods. The results provide in this paper indicates the potential practical application of SCMA decoder.","PeriodicalId":206199,"journal":{"name":"2016 IEEE International Conference on Digital Signal Processing (DSP)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE International Conference on Digital Signal Processing (DSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDSP.2016.7868575","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

With the requirement of rapid traffic growth and tremendous access, non-orthogonal multiple access becoming a prominent technology in the current 5G research area. The sparse code multiple access (SCMA) scheme is one of the most promising technology among the non-orthogonal technologies. In this work, we propose a tree pruned method based on MAX log-message decoding algorithm (MPA) to reduce the decoding complexity of SCMA significantly. We first formulate the decoding problem to a tree updating process. By using the tree pruned method, the sub nodes with lower weight can be updated by low complexity arithmetic operations. According to the simulation result, the proposed tree pruned method reduces 30% computation complexity compared with existing methods. The results provide in this paper indicates the potential practical application of SCMA decoder.
基于树修剪方法的低复杂度稀疏码多址解码器
随着流量的快速增长和海量接入的需求,非正交多址成为当前5G研究领域的突出技术。稀疏码多址(SCMA)方案是非正交技术中最有前途的技术之一。本文提出了一种基于MAX日志消息解码算法(MPA)的树修剪方法,以显著降低SCMA的解码复杂度。我们首先将解码问题表述为树更新过程。采用树剪枝方法,可以通过低复杂度的算术运算来更新权值较低的子节点。仿真结果表明,所提出的树修剪方法与现有方法相比,计算复杂度降低了30%。本文提供的结果表明了SCMA解码器的潜在实际应用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信