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

Author

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

Author_Institution

Inst. of Commun. Eng., Nat. Tsing Hua Univ., Hsinchu, Taiwan

fYear

2010

fDate

17-20 Oct. 2010

Firstpage

501

Lastpage

506

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.

Keywords

block codes; iterative decoding; linear codes; message passing; parity check codes; reliability; decoding complexity; finite field operations; low-complexity iterative reliability-based decoding algorithm; message-passing decoding algorithm; one-step majority-logic decoding; q-ary linear block codes; q-ary sum product algorithm; Complexity theory; Decoding; Iterative decoding; Null space; Reliability; Variable speed drives;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory and its Applications (ISITA), 2010 International Symposium on

Conference_Location

Taichung

Print_ISBN

978-1-4244-6016-8

Electronic_ISBN

978-1-4244-6017-5

Type

conf

DOI

10.1109/ISITA.2010.5650154

Filename

5650154