低复杂度LDPC码译码算法  

Low complexity algorithm for decoding LDPC codes

作　　者：林海涛[1] 窦高奇[1] 高俊[1] 张文娟[1] 

机构地区：[1]海军工程大学电子工程学院,武汉430033

出　　处：《海军工程大学学报》2010年第5期16-20,共5页Journal of Naval University of Engineering

基　　金：国家部委基金资助项目(40106070102)

摘　　要：提出了一种低复杂度的LDPC码译码算法CSPA(combined sum-productalgorithm),该算法初始迭代采用和积译码算法(SPA),当大部分信息趋于稳定时,将算法切换到选择节点更新算法(SNU)。仿真表明:在中长码时,新算法克服了SNU算法收敛速度慢和较高错误平台的不足;与和积译码算法相比,该算法以微弱的性能损失换取复杂度的有效降低。A low complexity algorithm（combined sum-product algorithm,CSPA）for decoding lowdensity parity-check codes is proposed,which works based on the sum-product algorithm（SPA）at first,and then switches to the selective node update（SNU）algorithm after most of the message has been converged.The computer simulations show that at a moderate code length,the proposed algorithm can overcome the deficiencies in SNU algorithm for its slow convergence rate and high error platform and effectively reduce the complexity in computation with little loss in the BER performance when compared with SPA.

关 键 词：纠错编码 LDPC码 和积译码算法 迭代译码算法 

分 类 号：TN911.22[电子电信—通信与信息系统]