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
- Jun-2007
- Publisher
- ISIT
- Citation
- IEEE International Symposium on Information Theory - Proceedings, pp.2256 - 2260
- Indexed
- SCOPUS
- Journal Title
- IEEE International Symposium on Information Theory - Proceedings
- Start Page
- 2256
- End Page
- 2260
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/179989
- DOI
- 10.1109/ISIT.2007.4557555
- ISSN
- 2157-8101
- 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 prolographs 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
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 융합전자공학부 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/179989)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.