A Low-Complexity Adaptive Extended Min-Sum Algorithm for Non-Binary LDPC Codes

Min-Ho Kim, Kyeong-Bin Park, Ki-Seok Chung
{"title":"A Low-Complexity Adaptive Extended Min-Sum Algorithm for Non-Binary LDPC Codes","authors":"Min-Ho Kim, Kyeong-Bin Park, Ki-Seok Chung","doi":"10.1109/ICCIA49625.2020.00048","DOIUrl":null,"url":null,"abstract":"The extended min-sum algorithm (EMS) for decoding non-binary low density parity check (NB-LDPC) codes reduces the decoding complexity by truncating the message vector by retaining only the most reliable symbols. However, the EMS algorithm does not consider that the noise of the received codeword is gradually reduced as the iteration count goes up. In this paper, we propose a low-complexity adaptive EMS algorithm, called threshold-based EMS (TB-EMS). The TB-EMS algorithm has a simple adaptive rule to calculate the new message vector length compared to the A-EMS. The proposed algorithm selects one of two message vector lengths. Experimental results show that the proposed algorithm reduces the decoding complexity with minimal performance degradation compared with the EMS algorithm. Further, the decoding performance of the TB-EMS is better than A-EMS.","PeriodicalId":237536,"journal":{"name":"2020 5th International Conference on Computational Intelligence and Applications (ICCIA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 5th International Conference on Computational Intelligence and Applications (ICCIA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCIA49625.2020.00048","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The extended min-sum algorithm (EMS) for decoding non-binary low density parity check (NB-LDPC) codes reduces the decoding complexity by truncating the message vector by retaining only the most reliable symbols. However, the EMS algorithm does not consider that the noise of the received codeword is gradually reduced as the iteration count goes up. In this paper, we propose a low-complexity adaptive EMS algorithm, called threshold-based EMS (TB-EMS). The TB-EMS algorithm has a simple adaptive rule to calculate the new message vector length compared to the A-EMS. The proposed algorithm selects one of two message vector lengths. Experimental results show that the proposed algorithm reduces the decoding complexity with minimal performance degradation compared with the EMS algorithm. Further, the decoding performance of the TB-EMS is better than A-EMS.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
非二进制LDPC码的低复杂度自适应扩展最小和算法
非二进制低密度奇偶校验码(NB-LDPC)译码的扩展最小和算法(EMS)通过只保留最可靠的符号来截断消息向量,从而降低了译码复杂度。然而,EMS算法没有考虑到接收码字的噪声随着迭代次数的增加而逐渐减小。本文提出了一种低复杂度的自适应EMS算法,称为基于阈值的EMS (TB-EMS)。与a - ems相比,TB-EMS算法具有简单的自适应规则来计算新消息向量长度。该算法从两个消息向量长度中选择一个。实验结果表明,与传统的EMS算法相比,该算法在降低译码复杂度的同时,性能下降最小。此外,TB-EMS的解码性能优于A-EMS。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Does ensemble really work when facing the twitter semantic classification? A Short-Term Hybrid Forecasting Approach for Regional Electricity Consumption Based on Grey Theory and Random Forest A negative selection algorithm based on adaptive immunoregulation ICCIA 2020 Breaker Page Video Prediction and Anomaly Detection Algorithm Based On Dual Discriminator
×
引用
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