A subp-optimal log-domain decoding algorithm for non-binary LDPC codes

  • Authors:
  • Chirag Dadlani;Ranjan Bose

  • Affiliations:
  • Department of Electrical Engineering, Indian Institute of Technology, Delhi, India;Department of Electrical Engineering, Indian Institute of Technology, Delhi, India

  • Venue:
  • ACE'10 Proceedings of the 9th WSEAS international conference on Applications of computer engineering
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Low-Density Parity-Check (LDPC) codes have gained significant popularity recently and have been recommended for various wireless standards of the future. Non-binary LDPC codes provide all the well-known advantages of binary LDPC codes but allow for much shorter block lengths. The sum-product decoding algorithm for non-binary LDPC codes is too complex for efficient implementation. Hence, we have represented the sum-product algorithm in a novel log-domain form in terms of operators defined earlier in literature. This form greatly simplifies the key step in the check-node processing and allows us to replace a max* operation in the decoder by a max operation. This leads to a sub-optimal decoding algorithm which we propose in this paper.