論文ID: 2024EAL2080
Reliability-based belief propagation (RBP) decoding algorithms are used to decode low-density parity-check (LDPC) codes. However, due to the reliability of comparing and sorting in traditional algorithms, conventional RBP decoders significantly lose in resource consumption. This letter presents an enhanced reliability list-based check-belief propagation (RL-CBP) algorithm. The RL-CBP algorithm reduces computational complexity by scheduling a concise list of check-beliefs. Moreover, the list is applied for comparisons and selections of check-beliefs. The selected checkbelief transforms the decoding message between edges; all check-beliefs are iteratively enlarged according to the reliabilities, and high-performance decoding will be achieved. The simulation results and analyses show that the proposed method achieves a reliability-list gain compared with the checkbelief propagation (CBP) algorithm but consumes much fewer calculations than the traditional RBP algorithm.
