CASTING SIMULATION

Presented By:
Dr P Prabhakara Rao
Assistant Professor
MEDKITSW
 WHY LDPC??
have excellent distance properties: the minimum distance d min, in
between codewords increases with N when column and row
weights are held fixed

The decoding algorithm is tractable

The low-density nature of the parity check matrix thus,

fortuitously, contributes both to good distance properties and the
relatively low complexity of the decoding algorithm.
 REGULAR VS IRREGULAR LDPC CODES
An LDPC code is regular if the rows and columns of H have uniform weight,
i.e. all rows have the same number of ones (dv) and all columns have the same
number of ones (dc)
The codes of Gallager and MacKay were regular (or as close as possible)
Although regular codes had impressive performance, they are still about 1
dB from capacity and generally perform worse than turbo codes

An LDPC code is irregular if the rows and columns have non-uniform weight
Irregular LDPC codes tend to outperform turbo codes for block lengths of
about n>105
CONSTRUCTION OF LDPC ENCODER
Here as k=4 so message input length is 4 bits
therefore there are total 16 combinations that
means we get 16 different codewords .We can get
these codewords by C=m.G
 DECODING IN LDPC
Like Turbo codes, LDPC can be decoded iteratively
Instead of a trellis, the decoding takes place on a Tanner graph
Messages are exchanged between the v-nodes and c-nodes
Edges of the graph act as information pathways
Hard decision decoding
Bit-flipping algorithm
Soft decision decoding
Sum-product algorithm
Also known as message passing/ belief propagation algorithm

Min-sum algorithm
Reduced complexity approximation to the sum-product algorithm

In general, the per-iteration complexity of LDPC codes is less than it is for

turbo codes
However, many more iterations may be required (max100;avg30)
Thus, overall complexity can be higher than turbo
 TANNER GRAPHS
A Tanner graph is a bipartite graph that describes the parity check matrix H
There are two classes of nodes:
Variable-nodes: Correspond to bits of the codeword or equivalently, to
columns of the parity check matrix
There are n v-nodes

Check-nodes: Correspond to parity check equations or equivalently, to rows

of the parity check matrix
There are m=n-k c-nodes

Bipartite means that nodes of the same type cannot be connected (e.g. a c-
node cannot be connected to another c-node)
The ith check node is connected to the jth variable node iff the (i,j)th element of
the parity check matrix is one, i.e. if hij =1
All of the v-nodes connected to a particular c-node must sum (modulo-2) to
zero
ALGORTHIM FOR TANNER GRAPH
 Step-7:
Repeat step-5 to step-6 until S= all zeros (or)
predetermined no.of iterations are reached
Then stop the process
Therefore final received code vector after correcting
errors is [0 0 0 0 0 0]
 ADVANTAGES
Follows iterative decoding algorithms with the per-iteration
complexity much lower than the per-iteration complexity of turbo
decoders
parallelizable in hardware

LDPC codes of almost any rate and block length can be created
simply by specifying the shape of the parity check matrix
 PRACTICAL USAGE

The powerful capabilities of LDPC codes have led to their recent

inclusion in several standards, such as
IEEE 802.16 (WiMax)
IEEE 802.20 (Mobile Broadband Wireless Access(MBWA))
IEEE 802.11n (MIMO)
IEEE 802.3 (Ethernet)
DBV-RS2.
 QUESTIONS

1. Suppose we have codewordc as follows: c c1 , c2 , c3 , c4 , c5 , c6

where each ci is either 0 or 1 and codeword now has three parity-check
equations.
c1 c2 c5 0
c1 c4 c6 0
c1 c2 c3 c6 0

a.) Determine the parity check matrix H by using the above equation
b.) Show the systematic form of H by applying Gauss Jordan elimination
c.) Determine Generator matrix G from H and prove G * HT = 0
d.) Find out the dimension of the H, G
e.) State whether the matrix is regular or irregular
 CONTD...

c1 c2 c5 0
1 1 0 0 1 0 6 columns and 3 rows
c1 c4 c6 0
H 1 0 0 1 0 1
c1 c2 c3 c6 0
1 1 1 0 0 1

Convert H into systematic formH sys using basic row and operations (try to avoid column
operations)
1 1 0 0 1 0 1 1 0 0 1 0
H 1 0 0 1 0 1 R2 R3 1 1 1 0 0 1
1 1 1 0 0 1 1 0 0 1 0 1

1 1 0 0 1 0 1 1 0 0 1 0
H 1 1 1 0 0 1 R2 R3 R2 0 1 1 1 0 0

1 0 0 1 0 1 1 0 0 1 0 1

1 1 0 0 1 0 1 1 0 0 1 0
H 0 1 1 1 0 0 R3 R3 R2 R1 0 1 1 1 0 0
1 0 0 1 0 1 0 0 1 0 1 1
CONTD..
1 1 0 0 1 0 1 0 0 1 0 1
H 0 1 1 1 0 0 R1 R1 R2 R3 0 1 1 1 0 0
0 0 1 0 1 1 0 0 1 0 1 1

1 0 0 1 0 1 1 0 0 1 0 1
H 0 1 1 1 0 0 R2 R2 R3 0 1 0 1 1 1
0 0 1 0 1 1 0 0 1 0 1 1

1 0 0 1 0 1
H sys 0 1 0 1 1 1
H sys I M P M K G PKTM I K
0 0 1 0 1 1
1 1 1
1 0 1
1 1 0 1 0 0 1 1 0 1 0 0 0 0 0
G 0 1 1 0 1 0
0 0 1
G.H 0 1 1 0 1 0
T
.
0 0 0

1 1 1 0 0 1 0 1 0
0 0 0
1 1 1 0 0 1 1 0 0

0 1 1
Dimensions of H =
Since the column weight and row weight changes,
3x6
this is an irregular parity check matrix
Dimensions of G =
 CONTD...

2. The parity check matrix H of LDPC code is given below:

10 1 0 0 1 1 0 1 0 0 1
01 1 1 1 0 1 0 0 0 0 1

01 01 0 1 0 1 1 1 0 0
H
1 1 10 0 0 0 1 1 0 1 0
0 0 01 1 0 1 0 0 1 1 1

1 0 0 0 1 1 0 1 0 1 1 0

a.) Determine the degree of rows and column

b.) State whether the LDPC code is regular or irregular
c.) Determine the rate of the LDPC code
d.) Draw the tanner graph representation of this LDPC code.
e.) What would be the code rate if we make rows equals to column
f.) Write down the parity check equation of the LDPC code
CONTD....

10 1 0 0 1 1 0 1 0 0 1
Dimensions of the
01
1 1 1 0 1 0 0 0 0 1 H matrix = 6x12
01 01 0 1 0 1 1 1 0 0 M 6, N 12, K N M 6
H
1 1 10 0 0 0 1 1 0 1 0
0 0 01 1 0 1 0 0 1 1 1 Row wr 6
weight
1 0 0 0 1 1 0 1 0 1 1 0 Column weight wc 3

Since the parity check matrix has a uniform row weight and uniform column
weight, this is a regular LDPC parity check matrix

Since the parity check matrix has a uniform row weight and uniform column
weight, this is a regular LDPC parity check matrix

Code rate R K N 612 1 2 , R 1

2

If we make the number of rows equal to columns code rate will be equal to 0
CONTD..
1 0 1 0 0 1 1 0 1 0 0 1
01 1 1 1 0 1 0 0 0 0 1

01 01 0 1 0 1 1 1 0 0
H
1 1 1 0 0 0 0 1 1 0 1 0
0 0 0 1 1 0 1 0 0 1 1 1

1 0 0 0 1 1 0 1 0 1 1 0
The parity check equations of the matrix are

z1 c1 c3 c6 c7 c9 c12
z 2 c2 c3 c4 c5 c7 c12
z3 c2 c4 c6 c8 c9 c10
z 4 c1 c2 c3 c8 c9 c11
z5 c4 c5 c7 c10 c11 c12
z6 c1 c5 c6 c8 c10 c11
 CONTD...

3. Consider parity check matrix H generated in question 1,

a.) Determine message bits length K, parity bits length M, codeword length N
b.) Use the generator matrix G obtained in question 1 to generate all possible codewords
c.
1 1 0 0 1 0 1 1 0 1 0 0 Dimensions of theH matrix = 3x6
H 1 0 0 1 0 1 G 0 1 1 0 1 0
1 1 1 0 0 1 1 1 1 0 0 1
M 3, N 6, K N M 3

All possible message set All possible codeword set

msg_1 000 codeword_1 msg_1.G 000000
msg_2 001 codeword_2 msg_2.G 111001

msg_3 010 codeword_3 msg_3.G 011010

msg_4 011 codeword_4 msg_4.G 100011
m c
msg_5 100 codeword_5 msg_5.G 110100

msg_6 101 codeword_6 msg_6.G 001101
msg_7 110 codeword_7 msg_7.G 101110

msg_8 111 codeword_8 msg_8.G 010111
 CONTD...
Question 4.
a.) What is the difference between regular and irregular LDPC codes?
b.) What is the importance of cycles in parity check matrix?
c.) Identify the cycles of 4 in the following tanner graph.

If the parity check matrix has uniform row weight and uniform column weight (same number of 1
in a column and same number of 1 in a row) we call that a regular parity check matrix.

The decoding algorithm assumes that the LDPC code is cycle free ( large girth sizes ). The short
cycles in the code ( cycles with a girth of 4 and cycles of girth of 6 ) weakens the code. Therefore
the codes must be carefully constructed to be free of short cycles.
Check Nodes

Variable Nodes
 RESEARCH OPPORTUNITIES
Code Design
Hardware Implementation
LDPC Application for next generation communication systems
(Wireless, OFDM, ADSL).
Improved LDPC using irregular graphs
Bypass Decoding -- A Reduced Complexity Decoding Technique for
LDPC
Randomly Punctured LDPC codes
Iteration aware LDPC code design for Low Power Optical
Communication.
Quasi Cyclic LDPC (QC-LDPC) codes
 CONCLUSION
We discussed;
Encoding & Decoding Process for LDPC Codes
Focused on advantages of LDPC over Turbo
Practical Applications Of LDPC Codes
Burning Research Opportunities of LDPC
THANK YOU!!!