Efficient implementations of the sum-product algorithm for decoding LDPC codes
- 13 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 1036-1036E
- https://doi.org/10.1109/glocom.2001.965575
Abstract
Efficient implementations of the sum-product algorithm (SPA) are presented for decoding low-density parity-check (LDPC) codes using log-likelihood ratios (LLR) as messages between symbol and parity-check nodes. Various reduced-complexity derivatives of the LLR-SPA are proposed. Both serial and parallel implementations are investigated, leading to trellis and tree topologies, respectively. Furthermore, by exploiting the inherent robustness of LLRs, it is shown, via simulations, that coarse quantization tables are sufficient to implement complex core operations with negligible or no loss in performance. The unified treatment of decoding techniques for LDPC codes presented here provides flexibility in selecting the appropriate design point in high-speed applications from a performance, latency and computational complexity perspective.Keywords
This publication has 10 references indexed in Scilit:
- A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domainPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On the design of low-density parity-check codes within 0.0045 dB of the Shannon limitIEEE Communications Letters, 2001
- Reduced-complexity decoding algorithm for low-densityparity-check codesElectronics Letters, 2001
- Decoding low density parity check codes with finite quantization bitsIEEE Communications Letters, 2000
- Gallager codes for CDMA applications. II. Implementations, complexity, and system capacityIEEE Transactions on Communications, 2000
- Reduced complexity iterative decoding of low-density parity check codes based on belief propagationIEEE Transactions on Communications, 1999
- Good error-correcting codes based on very sparse matricesIEEE Transactions on Information Theory, 1999
- An intuitive justification and a simplified implementation of the MAP decoder for convolutional codesIEEE Journal on Selected Areas in Communications, 1998
- Iterative decoding of binary block and convolutional codesIEEE Transactions on Information Theory, 1996
- Low-density parity-check codesIEEE Transactions on Information Theory, 1962