Mendeley
TY  _  JOUR
ID  -  13940901105047453
TI  -  A New Method for Short Block Length LDPC Code Design
JO  -  Nashriyyah -i Muhandisi -i Barq va Muhandisi -i Kampyutar -i Iran
JA  -  ES
LA  -  fa
SN  -  16823745
AU  -  Taki Mehrdad 
AU  -  Nezafati M. B.
AD  -  Ghom
AD  -  دانشگاه صنعتی مالک اشتر تهران
Y1  -  2007
PY  -  2007
VL  -  4
IS  -  
SP  -  249
EP  -  254
KW  -  Semi-random parity check matrixextended bit fillingfinite length irregular LDPC codes
DO  -  
N2  -  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.
UR  - rimag.ir/en/Article/27889
L1  - rimag.ir/en/Article/Download/27889
ER  -  
