CHAPTER 3

LDPC ENCODERS

3.1 INTRODUCTION

The encoder of LDPC has two main tasks: Construction of sparse parity check matrix
and generation of code word with the matrix. Sparsity indicates that each symbol node has
few connections to check nodes in the tanner graph. The parity check matrix which contain
only few number of 1’s in compared to number of 0’s.To reduce number of 1’s we are
applying many algorithm and methods. One of the methods is by using gauss elimination
which reduces the matrix H by applying elementary row and column operations. The
generator matrix G isn’t as sparse as the parity check matrix H, the complexity of encoding is
, and n denotes the block length.

3.2 CODE MATRIX(H) AND GENERATOR MATRIX(G)

A Tanner graph is a bipartite graph with n symbol nodes and r check nodes where
.The code matrix for this code is the adjacency matrix of the graph;
=1 if and only if is connected to . Let . The generator matrix
is constructed from reduced row-echelon form of H; H can be transformed to
via Gauss elimination and the generator matrix is
given by . The code rate of a code with code matrix

H is give by is and the equivalent generator matrix

is given by .

3.3 ALGORITHMS
The name Low Density Parity Check Codes comes from the characteristics of their parity
check matrix which contain only few number of 1’s in compared to number of 0’s.To reduce
number of 1’s we are applying many algorithm and methods.some of the algorithm are
briefly explained below.
3.3.1 LU Factorization
LU factorization was introduced by Neal. This algorithm is similar to gauss elimination, in
this algorithm used to free encoding process of dense inverse operation. In systematic
encoding the parity check matrix of an LDPC encoder can be partitioned into two sub
matrices B and A where B matrix is given by and A matrix is given by
, that is .
A codeword can be split into systematic form with the first k bits as source message bit s
and the remaining bits c as parity check bits, such as The encoding

in this algorithm should satisfy that is .

Advantages of LU factorization are: Applicable for any matrix, finds all solutions, easy to
program and fast. And one of the disadvantage is it is not easy to find a good sparse LU
decomposition for arbitrary H matrix.

3.3.2 Approximate Linear Triangulation Algorithm(ALT)

The Parity check matrix(PCM) of a LDPC code is sparse but the generator matrix (GM ) is
generally not sparse. In a linear time encoding of LDPC codes are based on an approximate
lower triangular (ALT) form of an L×N (N is the block length of the code and L is the
number of parity check equations) parity check matrix. The complexity of coding with
generator matrix G is too high because of not sparse. The way of coding that used mostly at
present is encoding with a specified parity check matrix H with a low triangular shape which
was proposed by Richardson and UrBanke(named as RU algortithm) According to their
method, they transformed the parity check matrix H to a low triangular shape as figure 3.1
 Figure 3.1 Approximate Linear Triangulation Form
In the above ALT form the G denotes gap in linear encoding with . The complexity of
this algorithm is given by .the idea is to convert the parity check matrix into an
equivalent lower triangular form as shown in figure 3.1.The gap is actually the number of
rows of the PCM that cannot be brought into triangular form by row and column permutation.
The main disadvantage is there is no exact programmable step by step algorithm.

3.3.3 Greedy permutation algorithm

Greedy permutation algorithm transform parity check matrix (PCM) into an

Approximately Lower Triangular (ALT) form with minimum gap .Gap refers to the
number of rows in the PCM that cannot be brought into triangular form by row and
column permutations. The complexity of this algorithm is given by . Drawback
of this algorithm is No exact programmable step-by-step algorithm only mathematical
calculations. Thus it enables tradeoffs between the gap size (i.e. the encoding
complexity) and the performance, for any given block length.It deals only with the
reduction of parity check matrix.

3.3.4 Gaussian Elimination

The conventional way is systematic encoding with the generator matrix derived from PCM
by (modulo-2) Gaussian elimination. The method is the same for any block code, thus it does
not deploy the sparseness of LDPC codes, and the complexity is , where n is the length
of the codeword. This method is used for finding the unknown generator matrix from the
PCM achieved through row permutations, modulo-2 sums of rows and some column
permutation. The codeword is given by and the parity check matrix H is given by
and the generator matrix is given by .it is used to reduce H into row-
echelon form by applying elementary row operations. The encoded codeword v is derived
from the matrix multiplication .