首页 | 本学科首页   官方微博 | 高级检索  
     

一种低复杂度的短LDPC码级联译码算法
引用本文:卞银兵,酆广增.一种低复杂度的短LDPC码级联译码算法[J].数据采集与处理,2010,25(2).
作者姓名:卞银兵  酆广增
作者单位:南京邮电大学通信与信息工程学院,南京,210003
摘    要:为了提高短低密度校验码(Short LDPC)的纠错性能,在研究盒匹配译码算法(BMA)和置信度与分阶统计译码级联算法(BP-OSD)的基础上,提出了一种新的针对短LDPC码译码的BP-BMA级联算法.该算法充分利用了BMA算法具有较低译码复杂度的特性.然后,利用该算法结合对数似然比累积(ALLR)算法进行了计算机仿真.仿真结果表明:BP-BMA级联算法与BP-OSD相比,译码性能有所提高,且译码复杂度大大降低了,在译码性能和复杂度间取得了很好的折中.

关 键 词:短LDPC码  置信度传播  分阶统计译码  盒匹配译码算法  级联算法

Novel Concatenation Decoding Algorithm for Short LDPC Codes with Lower Complexities
Bian Yinbing,Feng Guangzeng.Novel Concatenation Decoding Algorithm for Short LDPC Codes with Lower Complexities[J].Journal of Data Acquisition & Processing,2010,25(2).
Authors:Bian Yinbing  Feng Guangzeng
Affiliation:Bian Yinbing,Feng Guangzeng(College of Telecommunication , Information Engineering,Nanjing University of Posts , Communication,Nanjing,210003,China)
Abstract:To improve the error-correcting performance of short low-density-parity-code(LDPC),based on the box and match decoding algorithm(BMA),and the belief propagation serially concatenated with ordered statistics decoding algorithm(BP-OSD),a BP serially concatenated with BMA(BP-BMA) algorithm for the decoding of short LDPC codes is proposed.The BP-BMA algorithm can utilize the decoding complexity of BMA lower than that of OSD.Then,combined with the accumulated log-likelihood ratio(LLR) algorithm,computer simulati...
Keywords:short LDPC codes  belief propagation  ordered statistic decoding  box and match algorithm  concatenation algorithm  
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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