Divide & Concur and Difference-Map BP Decoders for LDPC Codes
Jonathan S. Yedidia, Yige Wang, and Stark C. Draper

TL;DR
This paper introduces novel LDPC decoding algorithms based on the Divide and Concur framework and difference-map dynamics, which improve error-floor performance by avoiding trapping sets while maintaining computational efficiency.
Contribution
It presents two new decoders for LDPC codes that leverage DC and difference-map concepts, enhancing error-floor performance over standard BP decoders.
Findings
DMBP significantly reduces error floors compared to BP.
Decoders based on DC and difference-map are computationally comparable to BP.
Simulation results show improved performance on AWGN and BSC channels.
Abstract
The "Divide and Concur'' (DC) algorithm, recently introduced by Gravel and Elser, can be considered a competitor to the belief propagation (BP) algorithm, in that both algorithms can be applied to a wide variety of constraint satisfaction, optimization, and probabilistic inference problems. We show that DC can be interpreted as a message-passing algorithm on a constraint graph, which helps make the comparison with BP more clear. The "difference-map'' dynamics of the DC algorithm enables it to avoid "traps'' which may be related to the "trapping sets'' or "pseudo-codewords'' that plague BP decoders of low-density parity check (LDPC) codes in the error-floor regime. We investigate two decoders for low-density parity-check (LDPC) codes based on these ideas. The first decoder is based directly on DC, while the second decoder borrows the important "difference-map'' concept from the DC…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsError Correcting Code Techniques · Bayesian Modeling and Causal Inference · DNA and Biological Computing
