Candidate bit based bit-flipping decoding algorithm for LDPC codes

Author

Dong, Guiqiang ; Yanan Li ; Xie, Ningde ; Zhang, Tong ; Liu, Huaping

Author_Institution

ECSE Dept., Rensselaer Polytech. Inst., Troy, NY, USA

fYear

2009

fDate

June 28 2009-July 3 2009

Firstpage

2166

Lastpage

2168

Abstract

A novel hard-decision decoding algorithm for low-density parity-check (LDPC) codes is proposed in this paper. This algorithm employs the correlation information among the column vectors of the parity-check matrix and syndrome vector for decoding. It does not require soft information, and has low decoding complexity. Simulation results show that the proposed decoding algorithm could provide an effective tradeoff between error performance and decoding complexity.

Keywords

computational complexity; decoding; matrix algebra; parity check codes; vectors; LDPC codes; bit-flipping decoding algorithm; candidate bit; column vectors; correlation information; decoding complexity; hard-decision decoding algorithm; low-density parity-check codes; parity-check matrix; soft information; syndrome vector; Computational complexity; Computational modeling; Computer science; Error probability; Iterative algorithms; Iterative decoding; Parity check codes; Zinc; Low-density parity-check (LDPC) codes; bit-flipping decoding;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory, 2009. ISIT 2009. IEEE International Symposium on

Conference_Location

Seoul

Print_ISBN

978-1-4244-4312-3

Electronic_ISBN

978-1-4244-4313-0

Type

conf

DOI

10.1109/ISIT.2009.5205798

Filename

5205798