New algorithm for LDPC decoding over GF(q)

Research output: Contribution to journalArticlepeer-review

Abstract

This paper present a novel decoding scheme for Low Density Parity Check codes (LDPC) over GF(q). The scheme is a variation of the sum-product algorithm. The novel algorithm has a low complexity and reduces the number of Look Up Table accesses necessary. Moreover, the algorithm does not compute division or multiplication, making it suitable for hardware implementation. The new algorithm has been compared with existing algorithms showing that both the BER performance and the speed of convergence are identical.

Original languageEnglish
Pages (from-to)425-430
Number of pages6
JournalIEE Conference Publication
Issue numberCP 511
DOIs
Publication statusPublished - 2005
EventIEE Irish Signals and Systems Conference - Dublin, Ireland
Duration: 1 Sep 20052 Sep 2005

Keywords

  • GF(q)
  • LDPC
  • Sum-product algorithm

Fingerprint

Dive into the research topics of 'New algorithm for LDPC decoding over GF(q)'. Together they form a unique fingerprint.

Cite this