A message-passing decoding algorithm for q-ary LDPC codes with low-complexity

Chao-Yu Chen, Qin Huang, Chi Chao Chao, Shu Lin

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper presents a novel low-complexity iterative reliability-based decoding algorithm for LDPC codes over q-ary finite fields. This proposed algorithm has low complexity and hence provides an effective trade-off between error performance and decoding complexity compared to q-ary sum product algorithm. This decoding algorithm is devised based on simple orthogonal concept of one-step majority-logic decoding for q-ary linear block codes. It requires only integer and finite field operations and converges very fast in decoding. It is particularly effective for decoding LDPC codes constructed based on finite geometries and finite fields.

Original languageEnglish
Title of host publicationISITA/ISSSTA 2010 - 2010 International Symposium on Information Theory and Its Applications
Pages501-506
Number of pages6
DOIs
Publication statusPublished - 2010 Dec 1
Event2010 20th International Symposium on Information Theory and Its Applications, ISITA 2010 and the 2010 20th International Symposium on Spread Spectrum Techniques and Applications, ISSSTA 2010 - Taichung, Taiwan
Duration: 2010 Oct 172010 Oct 20

Publication series

NameISITA/ISSSTA 2010 - 2010 International Symposium on Information Theory and Its Applications

Other

Other2010 20th International Symposium on Information Theory and Its Applications, ISITA 2010 and the 2010 20th International Symposium on Spread Spectrum Techniques and Applications, ISSSTA 2010
CountryTaiwan
CityTaichung
Period10-10-1710-10-20

All Science Journal Classification (ASJC) codes

  • Computational Theory and Mathematics
  • Information Systems

Fingerprint Dive into the research topics of 'A message-passing decoding algorithm for q-ary LDPC codes with low-complexity'. Together they form a unique fingerprint.

Cite this