首页 | 官方网站   微博 | 高级检索  
     

一种简化的LDPC码BP译码算法的研究
引用本文:尹晓琦,殷奎喜,李忠慧.一种简化的LDPC码BP译码算法的研究[J].现代电子技术,2006,29(14):148-151.
作者姓名:尹晓琦  殷奎喜  李忠慧
作者单位:1. 南京师范大学,物理科学与技术学院,江苏,南京,210097;淮阴工学院,江苏,淮安,223001
2. 南京师范大学,物理科学与技术学院,江苏,南京,210097
基金项目:地理信息科学江苏省重点实验室开发基金资助(JK20050304)
摘    要:低密度奇偶校验码(LDPC码)是一种逼近香农限的线性分组码,译码的复杂度较低;在LDPC码译码算法中性能较好的是置信传播译码(BP)算法,他能够在迭代译码过程中确定码字是否已译出,但是复杂度高,运算量大。采用一种改进的BP译码算法,在迭代译码过程中对校验节点的更新信息进行曲线拟合,以减小译码运算量,有利于硬件的并行实现,减少译码延时。仿真结果表明,改进的BP算法译码性能和原来的BP算法接近,而且复杂度较低。

关 键 词:LDPC码  SP算法  曲线拟合  迭代译码
文章编号:1004-373X(2006)14-148-04
收稿时间:2006-03-14
修稿时间:2006年3月14日

Study of Simple LDPC Codes BP Algorithm
YIN Xiaoqi,YIN Kuixi,LI Zhonghui.Study of Simple LDPC Codes BP Algorithm[J].Modern Electronic Technique,2006,29(14):148-151.
Authors:YIN Xiaoqi  YIN Kuixi  LI Zhonghui
Affiliation:1. College of Physics Science and Techology, Nanjing Normal University, Nanjing,210097,China;2. Huaiyin University of Technology, Huaian,223001,China
Abstract:Low Density Parity Check Codes(LDPC) is a kind of linear group codes which can be near the Shannon limit,the complexity of decoding is low.The BP decoding algorithm has a good performance among the decoding algorithms,it can make certain that if the codes are decoded in the iterative decoding process,but it is complicated and needs large operations.In this paper,a better algorithm is proposed to reduce the amount of operations by curve fitting when updating the computation of check codes,it is useful for the realizing of hardware and can reduce decoding delay.The results of computer simulation have shown that the proposed algorithm has similar performance with the traditional BP algorithm,and it is less complicated.
Keywords:LDPC codes  Sum-Product algorithm  curve fitting  iterative decoding
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号