Hybrid Iterative Decoding for Low-Density Parity-Check Codes Based on Finite Geometries

Author

Li, Jian ; Zhang, Xian-Da

Author_Institution

Tsinghua Univ., Beijing

Volume

12

Issue

1

fYear

2008

fDate

1/1/2008 12:00:00 AM

Firstpage

29

Lastpage

31

Abstract

In this letter, a two-stage hybrid iterative decoding algorithm which combines two iterative decoding algorithms is proposed to reduce the computational complexity of finite geometry low-density parity-check (FG-LDPC) codes. We introduce a fast weighted bit-flipping (WBF) decoding algorithm for the first stage decoding. If the first stage decoding fails, the decoding is continued by the powerful belief propagation (BP) algorithm. The proposed hybrid decoding algorithm greatly reduces the computational complexity while maintains the same performance compared to that of using the BP algorithm only.

Keywords

iterative decoding; parity check codes; belief propagation algorithm; fast weighted bit-flipping decoding algorithm; finite geometries; finite geometry low-density parity-check codes; hybrid iterative decoding; AWGN; Belief propagation; Binary phase shift keying; Computational complexity; Computational geometry; Error correction; Iterative algorithms; Iterative decoding; Parity check codes; Sparse matrices;

fLanguage

English

Journal_Title

Communications Letters, IEEE

Publisher

ieee

ISSN

1089-7798

Type

jour

DOI

10.1109/LCOMM.2008.071563

Filename

4432324