Belief propagation passes LLRs between variable and check nodes. Converges to near-ML decoding on sparse graphs.
Tanner bipartite graph: variable nodes (circles) ↔ check nodes (squares). Edge = parity constraint.
BER vs Eb/N0: uncoded BPSK (red), LDPC after BP (blue), Shannon limit (orange dashed).