An investigation in iterative decoding of Reed-Solomon codes based on adaptive belief propagation

摘要

In this paper, a practical approach to the iterative soft-decision decoding algorithms based on adaptive belief propagation (ABP) is investigated for Reed-Solomon (RS) codes. The novelty is cascading a simplified Chase type decoder to the ABP scheme in each iteration, which can be viewed as an efficient termination criterion deployed in the ABP algorithm. Simulation results show that the proposed algorithm improves the FER performance and converges with fewer iterations averagely, which declares a significant complexity reduction.