New concatenated soft decoding of Reed-Solomon codes with lower complexities |
| |
Authors: | BIAN Yin-bing FENG Guang-zeng |
| |
Affiliation: | School of Telecommunication and Information Engineering, Nanjing University of Posts and Telecommunications, Nanjing 210003, China |
| |
Abstract: | 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 sott 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 tradeoffbetween the decoding performance and complexity. |
| |
Keywords: | Reed-Solomon codes soft decoding adaptive belief propagation box and match decoding algorithm LLR accumulation |
本文献已被 维普 万方数据 ScienceDirect 等数据库收录! |