Skip to main navigation Skip to search Skip to main content

Two low-complexity reliability-based message-passing algorithms for decoding non-binary LDPC codes

  • Chao Yu Chen*
  • , Qin Huang
  • , Chi Chao Chao
  • , Shu Lin
  • *Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

This paper presents two low-complexity reliability-based message-passing algorithms for decoding LDPC codes over non-binary finite fields. These two decoding algorithms require only finite field and integer operations and they provide effective trade-off between error performance and decoding complexity compared to the non-binary sum product algorithm. They are particularly effective for decoding LDPC codes constructed based on finite geometries and finite fields.

Original languageEnglish
Article number5582319
Pages (from-to)3140-3147
Number of pages8
JournalIEEE Transactions on Communications
Volume58
Issue number11
DOIs
StatePublished - Nov 2010
Externally publishedYes

Keywords

  • Reliability-based message-passing algorithms
  • fast Fourier transform q-ary sumproduct algorithm
  • non-binary LDPC codes

Fingerprint

Dive into the research topics of 'Two low-complexity reliability-based message-passing algorithms for decoding non-binary LDPC codes'. Together they form a unique fingerprint.

Cite this