New concatenated soft decoding of Reed-Solomon codes with lower complexities  

作　　者：BIAN Yin-bing,FENG Guang-zeng School of Telecommunication and Information Engineering,Nanjing University of Posts and Telecommunications,Nanjing 210003,China 

出　　处：《The Journal of China Universities of Posts and Telecommunications》2009年第3期4-7,23,共5页中国邮电高校学报（英文版）

基　　金：supported by the National Natural Science Foundation of China(60472104)

摘　　要：To improve error-correcting performance, an iterative concatenated soft decoding algorithm for Reed-Solomon （RS） codes is presented in this article. This algorithm brings both complexity as well as advantages in performance over presently popular sot~ decoding algorithms. The proposed algorithm consists of two powerful soft decoding techniques, adaptive belief propagation （ABP） and box and match algorithm （BMA）, which are serially concatenated by the accumulated log-likelihood ratio （ALLR）. Simulation results show that, compared with ABP and ABP-BMA algorithms, the proposed algorithm can bring more decoding gains and a better tradeoff between the decoding performance and complexity.To improve error-correcting performance, an iterative concatenated soft decoding algorithm for Reed-Solomon （RS） codes is presented in this article. This algorithm brings both complexity as well as advantages in performance over presently popular sot~ decoding algorithms. The proposed algorithm consists of two powerful soft decoding techniques, adaptive belief propagation （ABP） and box and match algorithm （BMA）, which are serially concatenated by the accumulated log-likelihood ratio （ALLR）. Simulation results show that, compared with ABP and ABP-BMA algorithms, the proposed algorithm can bring more decoding gains and a better tradeoff between the decoding performance and complexity.

关 键 词：Reed-Solomon codes soft decoding adaptive belief propagation box and match decoding algorithm LLR accumulation 

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