A modified Min-Sum algorithm for low-density parity-check codes
2010pp. 449–451
Citations Over TimeTop 22% of 2010 papers
Abstract
A modified Min-Sum algorithm for low-density parity check codes is proposed in this paper. The inaccurate check node messages of the Min-Sum algorithm compared to the belief propagation (BP) algorithm are compensated by modified variable node messages, which is different from the normalized Min-Sum algorithm. The modified factor is obtained before decoding program and only one extra multiplication is needed in one cycle. So the increased complexity is fairly low. The simulation results show that the bit error rate (BER) and average number of iteration of the modified Min-Sum algorithm are very close to the BP algorithm, the modified algorithm can improve the BER performance compared to the Min-Sum algorithm while added complexity slightly.
Related Papers
- → Iterative decoding beyond belief propagation(2010)17 cited
- Neural Enhanced Belief Propagation on Factor Graphs(2021)
- → Synthesizing LDPC Belief Propagation Decoding with Molecular Reactions(2018)7 cited
- → Neural Enhanced Belief Propagation on Factor Graphs(2020)34 cited
- → Region-based approximation to solve inference in loopy factor graphs : decoding LDPC codes by the Generalized Belief Propagation(2013)1 cited