Abstract
We present in this paper a new method for improving the decoding of the LDPC (low-density parity check) codes by optimising the log-SPA (sum-product algorithm). Currently, the LDPC codes give very good results with iterative decoding algorithm, log-SPA, based on the propagation confidence BP (belief propagation). To improve the existing log-SPA, we propose a decoding algorithm (log-SPA modified), which minimises the error decoding of words that could not be previously decoded. This algorithm is based on the dependency between the weight of the syndrome and the weight of the error sequence generated during iterations of decoding. Simulations illustrate the performance of our approach compared with classical LDPC code based on log-SPA.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
