Cycle Analysis and Construction of Protographs for QC LDPC Codes With Girth Larger Than 12

@article{Kim2007CycleAA,
  title={Cycle Analysis and Construction of Protographs for QC LDPC Codes With Girth Larger Than 12},
  author={Sunghwan Kim and Jong-Seon No and Habong Chung and Dong-Joon Shin},
  journal={2007 IEEE International Symposium on Information Theory},
  year={2007},
  pages={2256-2260}
}
A quasi-cyclic (QC) low-density parity-check (LDPC) code can be viewed as the protograph code with circulant permutation matrices. In this paper, we find all the subgraph patterns of protographs of QC LDPC codes having inevitable cycles of length 2i, i = 6,7,8,9,10, i.e., the cycles existing regardless of the shift values of circulants. It is also derived that if the girth of the protograph is 2g, g ges 2, its protograph code cannot have the inevitable cycles of length smaller than 6g. Based on… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 11 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 16 references

Analysis of the cycle-structure of LDPC codes based on Latin squares

  • 0. Milenkovic, S. Laendner
  • Proc. Inter Conf on Commun., pp. 777-781, 2004.
  • 2004
2 Excerpts

Vasic and 0 . Milenkovic , " Combinatorial constructions of low - density paritycheck codes for iterative decoding

  • B.
  • Inform . Theory
  • 2004

Similar Papers

Loading similar papers…