A binary message-passing decoding algorithm for LDPC codes

Author

Chen, Chao-Yu ; Huang, Qin ; Kang, Jingyu ; Zhang, Li ; Lin, Shu

Author_Institution

Dept. of Electr. & Comput. Eng., Univ. of California, Davis, CA, USA

fYear

2009

fDate

Sept. 30 2009-Oct. 2 2009

Firstpage

424

Lastpage

430

Abstract

This paper presents a soft reliability-based binary message-passing algorithm for decoding LDPC codes. This algorithm outperforms the existing weighted bit-flipping algorithms with much less computational complexity. It is particularly effective for decoding LDPC codes constructed based on finite-geometries and finite fields. The proposed algorithm can be simplified for applications in communication or storage systems where either soft reliability information is not available to the decoder or a simple decoder is needed.

Keywords

binary codes; computational complexity; decoding; message passing; parity check codes; reliability; LDPC codes; binary message-passing decoding algorithm; computational complexity; finite-geometries; soft reliability information; storage systems; weighted bit-flipping algorithms; Chaotic communication; Computational complexity; Galois fields; Iterative algorithms; Iterative decoding; Null space; Parity check codes; Performance analysis; Sum product algorithm; Wiring;

fLanguage

English

Publisher

ieee

Conference_Titel

Communication, Control, and Computing, 2009. Allerton 2009. 47th Annual Allerton Conference on

Conference_Location

Monticello, IL

Print_ISBN

978-1-4244-5870-7

Type

conf

DOI

10.1109/ALLERTON.2009.5394796

Filename

5394796