首页期刊简介编委会征稿启事出版道德声明审稿流程读者订阅论文查重联系我们English
引用本文
  • 袁建国,曾 磊,孙雪敏,等.LDPC码的一种高效加权比特翻转译码算法[J].电讯技术,2017,57(11): - .    [点击复制]
  • YUAN Jianguo,ZENG Lei,SUN Xuemin,et al.An efficient weighted bit flipping decoding algorithm of LDPC codes[J].,2017,57(11): - .   [点击复制]
【打印本页】 【下载PDF全文】 查看/发表评论下载PDF阅读器关闭

←前一篇|后一篇→

过刊浏览    高级检索

本文已被:浏览 1930次   下载 491 本文二维码信息
码上扫一扫!
LDPC码的一种高效加权比特翻转译码算法
袁建国,曾磊,孙雪敏,胡潇月,郭乔,吴英冬
0
(重庆邮电大学光通信与网络重点实验室;光电信息感测与传输技术重庆市重点实验室,重庆 400065;重庆邮电大学光通信与网络重点实验室,重庆 400065;重庆邮电大学 光电信息感测与传输技术重庆市重点实验室,重庆 400065)
摘要:
针对低密度奇偶校验(LDPC)码中加权比特翻转(WBF)译码算法在迭代过程中绝大多数情况都是进行单比特翻转,导致译码效率低并且可能会发生比特翻转“死循环”的现象,提出一种更为高效的加权比特翻转(EWBF)算法。该算法对翻转阈值进行了改进,使得每次迭代能够翻转多个比特,提高译码效率,并且能够避免译码过程出现的翻转“死循环”现象。仿真结果表明,所提译码算法与WBF算法、改进的WBF(MWBF)算法和IMWBF(Improved MWBF)算法相比,平均迭代次数分别降低51.6%~56.2%、49.6%~54.2%和48.1%~51.3%;而在译码性能方面,算法性能接近甚至优于IMWBF算法,当最大迭代次数设定为30次时,相比于IMWBF算法,在误码率为10-4时可获得0.92 dB 的增益。
关键词:  低密度奇偶校验码  加权比特翻转译码  死循环  翻转阈值
DOI:10.3969/j.issn.1001-893x.2017.11.003
基金项目:国家自然科学基金资助项目(61472464);重庆市基础与前沿研究计划项目(cstc2015jcyjA0554); 2016年重庆邮电大学大学生科研训练计划项目(A2016-61)
An efficient weighted bit flipping decoding algorithm of LDPC codes
YUAN Jianguo,ZENG Lei,SUN Xuemin,HU Xiaoyue,GUO Qiao,WU Yingdong
()
Abstract:
The weighted bit flipping (WBF) decoding algorithm of low density parity-check (LDPC) codes produces the single-bit flipping phenomenon during the iteration in most cases,which can result in the low decoding efficiency and may give rise to the “endless loop” of the bit flipping.For this phenomenon, a more efficient WBF(EWBF) algorithm is proposed. The proposed EWBF algorithm has improved the flipping threshold so as to flip the multiple-bit in each iteration and improve the decoding efficiency while avoiding the “endless loop” phenomenon during the decoding. Simulation results show that the average decoding iteration number of the proposed decoding algorithm, compared with the WBF algorithm, the modified WBF(MWBF) algorithm and the Improved MWBF(IMWBF) algorithm, can be reduced 51.6%~56.2%, 49.6%~54.2% and 48.1 %~51.3%. In terms of the decoding performance, the proposed algorithm’s performance is close to or even better than the IMWBF algorithm’s. When the maximum iteration number is set to 30 times, the net coding gain of the improved scheme is 0.92 dB better than that of IMWBF algorithms at the bit error rate(BER) of 10-4.
Key words:  low density parity-check (LDPC) code  weighted bit flipping (WBF)  endless loop  flipping threshold
安全联盟站长平台