Quasi-cyclic low-density parity-check codes with girth larger than 12
- Authors
- Kim, Sunghwan; No, Jong-Seon; Chung, Habong; Shin, Dong-Joon
- Issue Date
- Aug-2007
- Publisher
- IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
- Keywords
- girth; low-density parity-check (LDPC) codes; protograph; protograph codes; quasi--cyclic (QC) codes
- Citation
- IEEE TRANSACTIONS ON INFORMATION THEORY, v.53, no.8, pp.2885 - 2891
- Journal Title
- IEEE TRANSACTIONS ON INFORMATION THEORY
- Volume
- 53
- Number
- 8
- Start Page
- 2885
- End Page
- 2891
- URI
- https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/23557
- DOI
- 10.1109/TIT.2007.901193
- ISSN
- 0018-9448
- Abstract
- A quasi--cyclic (QC) low-density parity-check (LDPC) code can be viewed as the protograph code with circulant permutation matrices (or circulants). In this correspondence, we find all the subgraph patterns of protographs of QC LDPC codes having inevitable cycles of length 2 i, i = 6, 7, 8, 9, 10, i.e., the cycles that always exist 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 or 18. We also propose a couple of shift value assigning rules for circulants of a QC LDPC code guaranteeing the girth 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
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/23557)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.