Memory-efficient decoding of LDPC codes
J.K.-S. Lee, Jeremy Thorpe · 2005
We present a low-complexity quantization scheme for the implementation of regular (3,6) LDPC codes. The quantization parameters are optimized to maximize the mutual information between the source and the quantized messages. Using this non-uniform quantized belief propagation algorithm, we have simulated that an optimized 3-bit quantizer operates with 0.2 dB implementation loss relative to a floating point decoder, and an optimized 4-bit quantizer operates less than 0.1 dB quantization loss