Double-Hamming based QC LDPC codes with large minimum distance
Författare
Summary, in English
A new method using Hamming codes to construct base matrices of (J, K)-regular LDPC convolutional codes with large free distance is presented. By proper labeling the corresponding base matrices and tailbiting these parent convolutional codes to given lengths, a large set of quasi-cyclic (QC) (J, K)-regular LDPC block codes with large minimum distance is obtained. The corresponding Tanner graphs have girth up to 14. This new construction is compared with two previously known constructions of QC (J, K)-regular LDPC block codes with large minimum distance exceeding (J+1)!. Applying all three constructions, new QC (J, K)-regular block LDPC codes with J=3 or 4, shorter codeword lengths and/or better distance properties than those of previously known codes are presented.
Publiceringsår
2011
Språk
Engelska
Publikation/Tidskrift/Serie
[Host publication title missing]
Fulltext
- Available as PDF - 237 kB
- Download statistics
Dokumenttyp
Konferensbidrag
Ämne
- Electrical Engineering, Electronic Engineering, Information Engineering
Conference name
IEEE International Symposium on Information Theory, 2011
Conference date
2011-07-31 - 2011-08-05
Conference place
Saint Petersburg, Russian Federation
Status
Published
Forskningsgrupp
- Information Theory