Improved adaptive belief propagation algorithm with reduced complexity for concatenated SPC‐RS codes

Abstract

Abstract In this letter, a novel single parity check‐aided minimum sum (SPC‐aided MS) algorithm is proposed. A cascaded compiled code scheme is used to approximate the adaptive belief propagation (ABP) algorithm for Reed–Solomon (RS) codes using the min sum (MS) algorithm. The computational complexity is greatly reduced compared with the previous algorithm. Simulation results show that the SPC‐aided MS algorithm can achieve coding gains of up to 1.1, 0.7, and 0.6 dB for RS (255,239) code compared with the conventional ABP, LRBP, and HD‐P‐ABP algorithms, respectively under the condition of FER=10−3.

Keywords

• concatenated codes
• error correction codes
• Reed–Solomon codes