Protograph design for QC LDPC codes with large girth

Citations

SCOPUS

1

초록

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 protograph with multiple edges using combinatorial design is proposed for QC LDPC codes with girth larger than or equal to 12.

키워드

Combinatorial designGraph theoretic approachLow-density parity-check codesProtographQC LDPC codesQuasi-cyclicSubgraphsCodes (symbols)Coding errorsFrequency selective fadingGraph theoryInformation technologyError correction
제목
Protograph design for QC LDPC codes with large girth
저자
Park, HosungHong, SeokbeomNo, Jong-SeonShin, Dong-Joon
DOI
10.1109/ICTC.2010.5674263
발행일
2010-12
유형
Conference Paper
저널명
2010 International Conference on Information and Communication Technology Convergence, ICTC 2010
페이지
175 ~ 176