Available online at www.sciencedirect.

com
Available online at www.sciencedirect.com
Procedia
Engineering
Procedia Engineering
Procedia 00 (2011)
Engineering 000–000
15 (2011) 1622 – 1625
www.elsevier.com/locate/procedia

Advanced in Control Engineering and Information Science

Interleaved Processing of Bit-Flipping Decoding

For LDPC Codes
Qiao Guolei a*
a
First affiliation, Address, City and Postcode, Country
b
Second affiliation, Address, City and Postcode, Country

Abstract

The BF decoding algorithm for LDPC codes is simple. However, if the number of burst errors is bigger than which
BF algorithm can process, the decoding may fail. Interleaving technology is a kind of effective techniques to handle
burst errors. Under this technology, consecutive errors in one codeword can be dispersed into multiple code words,
therefore the number of errors in each codeword may be lower and in the range of processing ability of BF algorithm.
Thence the interleaving technology in decoding can reduce the probability of correction failing and improve the
transmission performance. In this paper, a class of burst channel has been studied and the interleaving is applied for
data transmission. Simulation results show that the use of interleaving techniques can effectively reduce error rate.

© 2011 Published by Elsevier Ltd. Open access under CC BY-NC-ND license.

Selection and/or peer-review under responsibility of [CEIS 2011]
LDPC Codes; BF (Weighted Bit-Flipping); Interleaving

1. Introduction

The family of Low-Density Parity-Check (LDPC) codes proposed Gallager in 1962 has attracted
substantial research interest. The Bit-Flipping (BF) decoding algorithm is based on the symbol hard
decision and can achieve only limited decoding performance [1]. To bridge the performance gap between

* Dong Zijian. Tel.: 086-518-8518366; fax: 086-518-8518364.

E-mail address: [email protected].

1877-7058 © 2011 Published by Elsevier Ltd. Open access under CC BY-NC-ND license.
doi:10.1016/j.proeng.2011.08.302
2 QiaoGuolei
Qiao Guolei，
/ Procedia Engineering
et al/ Procedia 15 (2011)
Engineering 1622 –000–000
00 (2011) 1625 1623

BF decoding and BP decoding [2], weighted BF decoding (WBF) and its variants algorithms were
proposed. WBF considers both the receive message reliability and the check relationship among those
messages [3]. Based on WBF, ,Zhang et al. proposed an improved weighted BF algorithm (IWBF) [4],
which further considered the influence of message reliability on the error metric, and achieved more better
decoding performance. However, the IWBF needs a weighting factor and the performance of algorithm
depends significantly on the weighting factor.
Those algorithms are simple, however, if the number of burst errors is bigger than which BF algorithm
can process, the decoding may fail. Interleaving technology is a kind of effective techniques to handle
burst errors. Under this technology, consecutive errors in one codeword can be dispersed into multiple
code words, therefore the number of errors in each codeword may be lower and in the range of processing
ability of BF algorithm. Thence the interleaving technology in decoding can reduce the probability of
correction failing and improve the transmission performance.
In this paper, a class of burst channel has been studied and the interleaving technology is applied for
data transmission. Simulation results show that the use of interleaving techniques can effectively reduce
error rate.
The remainder of this paper is organized as follows. We begin by discussing the BF, WBF, and IWBF
algorithms. In Section 3, we present the interleaving scheme for BF decoding algorithm. Simulation
results are presented in section 4, followed by conclusions.

2. BF, WBF and IWBF

H = hij
LDPC codes are defined by a sparse check matrix M N . Assume code word
C c0 , c1 ,..., cN 1
is transmitted with BPSK modulation, through a noisy channel. Let
r r0 , r1 ,..., rN 1 v v0 , v1 ,..., vN 1
be the soft-decision received sequence and be the hard-
m n, hmn 1 zm
decision sequence. Let be the set of bits connected with the check node ,
n m, hmn 1 vn
be the set of checks connected with the bit node .
The decoding process of BF is as follow:
T
S = Hv T s0 , s1 ,..., sM
1. Compute the syndrome . If S = 0 , then the iteration is terminated
1

and the decoding is declare successful. If not, go to the second step;

2. For each message node, compute the error metric:

En sum( S T hn ) (1)
3. Turn the bit with highest Ek value, and go to step 1.
The decoding process of WBF is as follow:
T
S = Hv T s0 , s1 ,..., sM
1. Compute the syndrome . If S = 0 , then the iteration is terminated
1

and the decoding is declare successful. If not, go to the second step;

2、Find the most unreliable message node associated with each check node :

rmmin min n,n m

rn
(2)
1624 Qiaoname
Author Guolei / Procedia
/ Procedia Engineering
Engineering 00 15 (2011)
(2011) 1622 – 1625
000–000 3

3、For each message node, compute the error metric:

En 2sm 1 rmmin
m n
(3)
The IWBF algorithm is different to WBF algorithm at the step 3. The error metric is replaced as:

En 2 sm 1 rmmin rn
m n
(4)
where the factor should be selected carefully to achieve better decoding performance.

3. BURST CHANNEL AND INTERLEAVING

Meteor burst communications (MBC), also referred to as meteor scatter communications, is a radio
propagation mode that exploits the ionized trails of meteors during atmospheric entry to establish brief
communications paths between radio stations up to 2250 kilometers (1400 miles) apart. Meteor trail
channel is a typical wireless intermittent NLOS channel. For the design of meteor burst communication
systems, using simulated channel for analysis and comparison is both simple and economic.
Interleaving technology is an effective technique to improve transmission performance under burst
channel. We consider the block interleaver in this paper, which processes the m n bits.
The scheme is as followed: In sender, the data is coded by a linear encoder, processed by an
interleaver, modulated, transported through a burst channel. In receiver, received signal is processed by
hard decision, deinterleaved, and then decoding by BF algorithm.

4. SIMULATIONS

The LDPC code selected in this article is a (1008,504,3,6) regular LDPC code given in [5]. Simulations
use the following criteria: meteor burst channel, BPSK modulation. The maximum number of iterations in
BF algorithm is fixed at 30.
From Fig.1 and Fig.2, we can see that the performance of proposed interleaving scheme is better than
that of BF. The interleaving scheme achieves 1.1dB processing gain at BER=10e-5, and 1.6dB processing
gain at FER=10e-4.
4 QiaoGuolei
Qiao Guolei，
/ Procedia Engineering
et al/ Procedia 15 (2011)
Engineering 1622 –000–000
00 (2011) 1625 1625

Fig.1 BER performance of (1008,504,3,6) regular LDPC codes

Fig.2 FER performance of (1008,504,3,6) regular LDPC codes

5. CONCLUSIONS

Combined with interleaving technology and the BF decoding algorithm, this paper proposes an
improved coding scheme for data transmission under burst channel. This scheme considers the case of
consecutive errors merged in one code word for the reason of burst interference. The interleaving scheme
can divided those consecutive errors into a few code words, and the decoding ability of BF algorithm can
solve the reduced errors in one codeword. Simulation results show that interleaving scheme is feasible,
effective.

References

[1] R.G.Gallager: Low-Density Parity-Check Codes. IRE Transactions on Information Theory, IT-
8(1962), p. 21–28.
[2] D. J. C. MacKay: Good error-correcting codes based on very sparse matrices. IEEE Trans. Inform.
Theory. vol. 45(1999), p. 399–432.
[3] Y.Kou, S. Lin and M. Fossorier: Low-density parity-check codes based on finite geometries: a
rediscovery and new results. IEEE Transactions on Information Theory, vol. 47(2001), p. 2711–2736.
[4] J. Zhang, M.P.C.Fossorier: A Modified Weighted Bit-Flipping Decoding of Low-Density Parity-
Check Codes. IEEE Communications Letters, vol. 8(2004), p. 165–167.
[5] Information on http://www.inference.phy.cam.ac.uk/mackay/codes/data.html#l25.