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

Chirag Dadlani, Ranjan Bose

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

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.

Original languageEnglish
Title of host publicationProceedings of the 9th WSEAS International Conference on Applications of Computer Engineering, ACE '10
Pages110-114
Number of pages5
StatePublished - 2010
Externally publishedYes
Event9th WSEAS International Conference on Applications of Computer Engineering, ACE '10 - Penang, Malaysia
Duration: Mar 23 2010Mar 25 2010

Publication series

NameProceedings of the 9th WSEAS International Conference on Applications of Computer Engineering, ACE '10

Conference

Conference9th WSEAS International Conference on Applications of Computer Engineering, ACE '10
Country/TerritoryMalaysia
CityPenang
Period03/23/1003/25/10

Keywords

  • Decoding algorithm
  • Low Density Parity Check (LDPC) Codes

Fingerprint

Dive into the research topics of 'A sub-optimal log-domain decoding algorithm for non-binary LDPC codes'. Together they form a unique fingerprint.

Cite this