Protograph design with multiple edges for regular QC LDPC codes having large girth

Citations

SCOPUS

4

초록

In this paper, all subgraph patterns of protographs which prevent quasi-cyclic (QC) low-density parity-check (LDPC) codes from having large girth are searched in allowance with multiple edges based on graph theoretic approach. A systematic construction of protographs with multiple edges using combinatorial design is proposed for designing QC LDPC codes with girth greater than or equal to 14.

키워드

Combinatorial designGraph theoretic approachLow-density parity-check codesQC LDPC codesQuasi-cyclicSubgraphsCodes (symbols)Coding errorsGraph theoryError correction
제목
Protograph design with multiple edges for regular QC LDPC codes having large girth
저자
Park, HosungHong, SeokbeomNo, Jong-SeonShin, Dong-Joon
DOI
10.1109/ISIT.2011.6034272
발행일
2011-10
유형
Conference Paper
저널명
IEEE International Symposium on Information Theory - Proceedings
페이지
918 ~ 922