Title :
Protograph design with multiple edges for regular QC LDPC codes having large girth
Author :
Park, Hosung ; Hong, Seokbeom ; No, Jong-Seon ; Shin, Dong-Joon
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., Seoul Nat. Univ., Seoul, South Korea
fDate :
July 31 2011-Aug. 5 2011
Abstract :
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.
Keywords :
cyclic codes; graph theory; parity check codes; combinatorial design; graph theoretic approach; large girth; low-density parity-check codes; multiple edges; protograph design; quasicyclic codes; regular QC LDPC codes; subgraph patterns; Bipartite graph; Educational institutions; Electronic mail; Iterative decoding; Systematics; Upper bound;
Conference_Titel :
Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on
Conference_Location :
St. Petersburg
Print_ISBN :
978-1-4577-0596-0
Electronic_ISBN :
2157-8095
DOI :
10.1109/ISIT.2011.6034272
