Memory-efficient decoding of LDPC codes
Authors:
- J.K.-S. LeeJLJ.K.-S. Lee
- J. ThorpeJTJ. Thorpe
- 1 January 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 459-463
Abstract
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 lossKeywords
This publication has 4 references indexed in Scilit:
- Reduced-Complexity Decoding of LDPC CodesIEEE Transactions on Communications, 2005
- On the design of low-density parity-check codes within 0.0045 dB of the Shannon limitIEEE Communications Letters, 2001
- The capacity of low-density parity-check codes under message-passing decodingIEEE Transactions on Information Theory, 2001
- Low-Density Parity-Check Codes1963