Improved bit-flipping decoding of low-density parity-check codes

Author

Miladinovic, Nenad ; Fossorier, Marc P C

Author_Institution

Dept. of Electr. Eng., Univ. of Hawaii, Honolulu, HI, USA

Volume

51

Issue

4

fYear

2005

fDate

4/1/2005 12:00:00 AM

Firstpage

1594

Lastpage

1606

Abstract

In this correspondence, a new method for improving hard-decision bit-flipping decoding of low-density parity-check (LDPC) codes is presented. Bits with a number of unsatisfied check sums larger than a predetermined threshold are flipped with a probability p ≤ 1 which is independent of the code considered. The probability p is incremented during decoding according to some rule. With a proper choice of the initial p, the proposed improved bit-flipping (BF) algorithm achieves gain not only in performance, but also in average decoding time for signal-to-noise ratio (SNR) values of interest with respect to p = 1.

Keywords

iterative decoding; parity check codes; probability; LDPC code; SNR; check sum; hard-decision bit-flipping decoding; low-density parity-check code; probability; signal-to-noise ratio; Bipartite graph; Geometry; Iterative algorithms; Iterative decoding; Logic; Null space; Parity check codes; Performance gain; Signal to noise ratio; Turbo codes; Bit flipping; iterative decoding; low-density parity-check (LDPC) codes;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/TIT.2005.844095

Filename

1412054