Abstract
LDPCC belief-propagation decoding algorithm uses a bipartite graph and sends belief messages between the variable symbols and the checks in an iterative process. The message that a check sends to a variable symbol can be calculated using Hadamard transform, as introduced in. However, the explicit proof of the correctness of the FHT implementation of the decoding algorithm has not been seen in the literature so far. In this paper, we give a proof for the FHT implementation of the decoding algorithm for LDPC codes over GF(q).
| Original language | English |
|---|---|
| Pages (from-to) | 2518-2519 |
| Number of pages | 2 |
| Journal | IEEE Vehicular Technology Conference |
| Volume | 60 |
| Issue number | 4 |
| Publication status | Published - 2004 |
| Externally published | Yes |
| Event | 2004 IEEE 60th Vehicular Technology Conference, VTC2004-Fall: Wireless Technologies for Global Security - Los Angeles, CA, United States Duration: 26 Sept 2004 → 29 Sept 2004 |
Keywords
- Belief-propagation algorithm
- Fast hadamard transform (FHT)
- Low-density parity-check codes (LDPCC)