HYBRID WEIGHTED BIT FLIPPING

LOW DENSITY PARITY CHECK

DECODING

Presented by
PRAMOD K
150915027

CONTENTS
INTRODUCTION
LDPC

CODES
LDPC ENCODING
BIT FLIPPING ALGORITHM
HWBF ALGORITHM
RESULTS
CONCLUSION
2

INTRODUCTION

Fig.1 Block Diagram of Digital Communication System

LOW DENSITY PARITY CHECK (LDPC) CODES

Developed by Robert G Gallager in 1963 at MIT.
In 1981, Tanner proposed a new interpretation of LDPC
codes from a graphical point of view.
Re-discovered in 1995 by MacKay and Neal.
LDPC codes are preferred over turbo codes because of
their lower decoding complexity especially when
operating at data rates close to 1.0 Gbps.
LDPC codes are used to correct retention errors occurred
in modern NAND flash memory.

Robert Gray Gallager

4

WHY IS IT CALLED LDPC?

H=

11110000000000000000
00001111000000000000
00000000111100000000
00000000000011110000
00000000000000001111
10001000100010000000
01000100010000001000
00100010000001000100
00010000001000100010
00000001000100010001
10000100000100000100
01000010001000010000
00100001000010000010
00010000100001001000
00001000010000100001

Parity Check Matrix of LDPC for n = 20, = 3 and = 4

ENCODING
Message m = [ m0 m1 m2..mk ]
Parity Check Matrix H(n-k)xn = [ PT(n-k)xk | I(n-k) ]
Generator Matrix Gk x n = [ Ik | Pk x (n-k) ]
Code-word c = [ c0 c1 c2.cn ]
c=m.G

110100
10 01 1 10 1 0
C = [ 1 1H] =
1 0 0 10 01 1
001101

=[001011]
6

DECODING
HARD DECISION DECODING

SOFT DECISION DECODING

Bit Flipping Decoding

Sum Product (SP) Decoder

Weighted Bit Flipping (WBF) Decoding

Log Sum Product (log SP) Decoder

Parallel Bit Flipping (PBF) Decoding

Minimum Sum Decoder

Reliability Ratio Based Weighted Bit Simplified

Flipping (RRWBF) Decoding

Soft

Distance

(SSD)

Decoder

TANNER GRAPHS

H=

110100
011010
100011
001101
cc4312 == vv3112 ++ vv4523 ++ vv645

Variable
nodes

Check
nodes

v1

v2

v3

v4

v5

c1

c2

c3

c4

v6

Tanner Graph
8

BIT FLIPPING DECODING

Steps involved in decoding
1. Initialisation Process
2. Check node process
3. Variable node process
4. Decision
5. Termination

BIT FLIPPING DECODING

Initialisation
Code-word

Received
code-word

Variable
nodes

v1

v2

v3

v4

v5

v6

Check
nodes

0 01
1
1
1
0
1
0
1

c1

c2

c3

c4

10

BIT FLIPPING DECODING

Check node process

c3412 = v1312 + v5423 + v645

c3412 = 101 + 110 +++101
c3421 = 101

Code-word

Received
code-word

Variable
nodes

v1

v2

v3

v4

v5

v6

c1

c2

c3

c4

Check
nodes

11

BIT FLIPPING DECODING

Variable node process
Code-word

Received
code-word

01

v1

v2

v3

v4

v5

v6

c1

c2

c3

c4

Number of check
equations not satisfied
Variable
nodes

Check
nodes

Bit flipped

12

HYBRID WEIGHTED BIT FLIPPING (HWBF) DECODING

The initial steps are same as bit flipping decoding, that is calculating syndrome vector.
Reliability ratio Rmn is found and the error term for each term is found out.
The error terms are arranged in ascendingdescending order to find a set of most
unreliable variable nodes.
The nth error term is associated with Wc,n number of syndrome sm, elements.
The set of check node connected with one or more eth, (e)th and (e)th hard decision
bit, be given as C(e), C(e) and C(e), respectively.
The set of check nodes connected only to eth, (e)th and (e)th hard decision bits be
given as C(e), C(e) and C(e) respectively.
13

HYBRID WEIGHTED BIT FLIPPING (HWBF) DECODING

14
Fig.2 Flow Chart of HWBF Algorithm

RESULTS
DecodingBit
Complexity
Iterations
Parallel
flipping
As compared to IRRWBF decoding, the number of iterations required for successful decoding is reduced by
As
Thecompared
proposed
to scheme
IRRWBFcan
decoding,
detect the
anddecoding
correct time
a maximum
required for
of 3successful
erroneous
decoding
hard decision
is reduced
bits
by in
more
an
than
usethe
of use
HWBF
decoding.
iteration.
more40%
thanwith
50%the
with
of HWBF
decoding.

Fig.5 Percent
Fig.3
Fig.4
.Percent
Percentincrease
reduction
reduction
in in
number
in number
decoding
of erroneous
oftime
decoding
of HWBF
bitsiterations
corrected
decoding
required
in IRRWBF
as compared
in IRRWBF
decoding
to IRRWBF
decoding
and HWBF
decoding
and
decoding,
HWBF
when
decoding,
as
the
the
SNR
SNR
isasvaried,
isthe
varied,
SNR
forfor
isdifferent
varied,
different
values
forvalues
different
of maximum
of maximum
values of
decoder
maximum
decoder
iteration,
iteration,
decoder
imx iiteration,
imx.
mx.

15

COMPARISION WITH OTHER DECODING METHODS

Fig.8 .Decoding
Fig.6
Number performance
of decoding iterations
of proposed
required
HWBF,
in
IRRWBF HWBF,
proposed
and NMS
IRRWBF
decoding
and
forNMS
FG-LDPC
decoding
(4095,
for
3367) code.codes and various values of imx.
FG-LDPC

Fig.9 Decoding
Fig.7
Decodingperformance
time of HWBF,
of proposed
IRRWBF
HWBF,
and
IRRWBF
NMS
decoding
and for
NMS
FG-LDPC
decoding
codes
forand
FG-LDPC
various
(1023, 781)
values
of imxcode.

16

CONCLUSIONS
The decoding time and the number of iterations required for convergence are less when
compared to soft decision decoding techniques.
The decoding performance is comparable to soft decision decoding techniques but
better than hard decision schemes.
In future research can be done to increase the performance of decoding and also
decrease decoding time and number of iteration.

17

REFERENCES
[1] R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
[2] R. M. Tanner, A recursive approach to low complexity codes, IEEE Trans. Inform. Theory, vol. IT27, no. 5, pp. 533547, September 1981.
[3] Honey Durga Tiwari, Harsh Durga Tiwari and Kang-Yoon Lee, Hybrid weighted bit flipping low
density parity check decoding.
[4] Sarah J. Johnson, Introducing Low-Density Parity-Check Codes.
[5] https://www.google.com
[6] https://en.wikipedia.org

18

THANK YOU

19