Log-domain decoding of LDPC codes over GF(q)
Top Cited Papers
- 1 January 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 772-776 Vol.2
- https://doi.org/10.1109/icc.2004.1312606
Abstract
This paper introduces a log-domain decoding scheme for LDPC codes over GF(q). While this scheme is mathematically equivalent to the conventional sum-product decoder, log-domain decoding has advantages in terms of implementation, computational complexity and numerical stability. Further, a suboptimal variant of the log-domain decoding algorithm is proposed, yielding a lower computational complexity. The proposed algorithms and the sum-product algorithm are compared both in terms of simulated BER performance and computational complexity.Keywords
This publication has 12 references indexed in Scilit:
- Reduced-complexity decoding of Q-ary LDPC codes for magnetic recordingIEEE Transactions on Magnetics, 2003
- Iterative demapping and decoding for multilevel modulationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- An efficient software radio implementation of the UMTS turbo codecPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Design of capacity-approaching irregular low-density parity-check codesIEEE Transactions on Information Theory, 2001
- Factor graphs and the sum-product algorithmIEEE Transactions on Information Theory, 2001
- Decoding low density parity check codes with finite quantization bitsIEEE Communications Letters, 2000
- Decoding and Equalization with Analog Non‐linear NetworksEuropean Transactions on Telecommunications, 1999
- Comparison of constructions of irregular Gallager codesIEEE Transactions on Communications, 1999
- Low-density parity check codes over GF(q)IEEE Communications Letters, 1998
- On turbo decoding of nonbinary codesIEEE Communications Letters, 1998