A Modified Belief Propagation Decoding Algorithm of LDPC Codes for Fast Convergence
Yao Senjie
Abstract
Yao Senjie
Abstract
This paper analyzed the Belief-Propagation decoding algorithm for Low-Density Parity Check Codes and researched the convergence characteristic of this algorithm,and then proposed a modified Belief-Propagation decoding algorithm aiming at decreasing the number of iteration.Simulation result shows that the number of iteration of the proposed algorithm is only one-third of the standard one at expense of little loss in performance.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper analyzed the Belief-Propagation decoding algorithm for Low-Density Parity Check Codes and researched the convergence characteristic of this algorithm,and then proposed a modified Belief-Propagation decoding algorithm aiming at decreasing the number of iteration.Simulation result shows that the number of iteration of the proposed algorithm is only one-third of the standard one at expense of little loss in performance.
Key concepts: Belief propagation, Low-density parity-check code, Algorithm, Decoding methods, Berlekamp–Welch algorithm, Convergence (economics), Sequential decoding, Computer science