Two Low-Complexity Reliability-Based Message-Passing Algorithms for Decoding Non-Binary LDPC Codes

Author

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

Author_Institution

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

Volume

58

Issue

11

fYear

2010

fDate

11/1/2010 12:00:00 AM

Firstpage

3140

Lastpage

3147

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.

Keywords

decoding; message passing; parity check codes; telecommunication computing; telecommunication network reliability; decoding nonbinary LDPC codes; finite fields; finite geometries; integer operations; low-complexity reliability-based message passing algorithms; nonbinary sum product algorithm; Complexity theory; Decoding; Geometry; Iterative decoding; Reliability; Variable speed drives; Reliability-based message-passing algorithms; fast Fourier transform q-ary sum-product algorithm; non-binary LDPC codes;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/TCOMM.2010.091310.090327

Filename

5582319