A New Method for Short Block Length LDPC Code Design

In this paper, we propose a new method for short block length Low Density Parity Check (LDPC) code design. The experimental results show that codes designed using the proposed algorithm have better performance compare to the other short block length LDPC codes. For LDPC code design in short block length, two problems arise: first analytical estimation of code performance using density evolution method is unusable because of infinity of code length in this method. Second because of high code density, the probability of short loop in code graph (Girth) is high that dramatically reduces the code performance. We propose solution for both problems. First, code structure is designed in such a way that the code performance is near to that of the density evolution method estimates and second by improving Extended Bit Filling algorithm, short block length is controlled.