Cycle analysis and construction of protographs for QC LDPC codes with girth larger than 12
- Authors
- Kim, Sunghwan; No, Jong-Seon; Chung, Habong; Shin, Dong-Joon
- Issue Date
- 2007
- Publisher
- IEEE
- Citation
- 2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, pp.2256 - +
- Journal Title
- 2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7
- Start Page
- 2256
- End Page
- +
- URI
- https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/29897
- DOI
- 10.1109/ISIT.2007.4557555
- Abstract
- 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 >= 2, its protograph code cannot have the inevitable cycles of length smaller than 6g. Based on these subgraph patterns, we propose new combinatorial construction methods of the protographs, whose protograph codes can have girth larger than or equal to 14.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > School of Electronic & Electrical Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.