This repository provides C and MATLAB implementations for LDPC codes.
For an overview of LDPC codes, please see: LDPC Wikipedia page or the book Modern Coding Theory by Tom Richardson and Rüdiger Urbanke.
WiFi (IEEE 802.11n) LDPC code construction
Encoding by back-substitution for WiFi LDPC codes
Iterative belief propagation (BP) Decoding (including min-sum)
AWGN simulations for BPSK, 4-ASK, 8-ASK (equivalently QPSK, 16-QAM, and 64-QAM)
It is worth emphasizing the code is not necessarily specification compliant with IEEE 802.11n. In particular, aspects such as puncturing, padding, and stream parsing are not implemented.
The figure above shows the performance of LDPC codes for various rates and constellation choices over AWGN channel.
The results are using LdpcC code, and are based on 50K runs.
The run time comparison is as follows (run on a single macbook pro 2015):
Parameters | LdpcC | LdpcM | Speedup C/M |
---|---|---|---|
N = 648, rate = 1/2 | 67 | 12 | 5.5x |
N = 1296, rate = 1/2 | 31 | 5.5 | 5.5x |
N = 1944, rate = 1/2 | 21 | 2.81 | 7.5x |
The above numbers are based on 20 iterations of the BP decoder without early termination. So, typically, one should see much better performance.
The key code is in class LdpcCode (C and MATLAB). The interface to this class is as follows:
load_wifi_ldpc
encode
decode
Note that for speed up of simulation, it is assumed in the main file that if a given run (as in info bit and noise realizations) is decoded for a lower EbNo value, then it will be decoded for a higher EbNo value.
The LdpcC code will not compile with libstdc++. The code only works with libc++.
The code is provided as is without any warranty (implicit or explicit) and without guarantee of correctness.