Current Algorithms for Decoding LDPC Codes

Hi,

In my master project, I worked on the simulations & analysis of some constructed LDPC codes. I modeled AWGN channel and BEC in addition to the sum-product algorithm (SPA) and the erasure decoder (ED) defined in "Johnson, S.J., Iterative error correction, Turbo, low-density parity-check and repeat-accumulate codes" in MATLAB. I believe my codes are correct because I checked several times. However, there are some minor anomalies in resulting BER/FER graphs. Also, for longer codes, the simulations take too much time (days, even weeks).

When I finished this projects (2019), there was no enough MATLAB documentation about LDPC codes. Now, I need to do these simulations again for an ongoing research. So I wonder whether there are new efficient algorithms for AWGN, BEC models and SPA, ED algorithms.

Also, if there is anyone who can check my codes and give feedbacks, it would be great. Thanks in advance.

[秋月]

i'm learning LDPC in BEC. Can you give me your simulation code .Thank you.