Quasi-cyclic low-density parity-check codes with girth larger than 12
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Sunghwan | - |
dc.contributor.author | No, Jong-Seon | - |
dc.contributor.author | Chung, Habong | - |
dc.contributor.author | Shin, Dong-Joon | - |
dc.date.accessioned | 2022-01-14T07:42:09Z | - |
dc.date.available | 2022-01-14T07:42:09Z | - |
dc.date.created | 2022-01-14 | - |
dc.date.issued | 2007-08 | - |
dc.identifier.issn | 0018-9448 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/23557 | - |
dc.description.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. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
dc.subject | LDPC CODES | - |
dc.subject | CONSTRUCTION | - |
dc.title | Quasi-cyclic low-density parity-check codes with girth larger than 12 | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Chung, Habong | - |
dc.identifier.doi | 10.1109/TIT.2007.901193 | - |
dc.identifier.wosid | 000248235400019 | - |
dc.identifier.bibliographicCitation | IEEE TRANSACTIONS ON INFORMATION THEORY, v.53, no.8, pp.2885 - 2891 | - |
dc.relation.isPartOf | IEEE TRANSACTIONS ON INFORMATION THEORY | - |
dc.citation.title | IEEE TRANSACTIONS ON INFORMATION THEORY | - |
dc.citation.volume | 53 | - |
dc.citation.number | 8 | - |
dc.citation.startPage | 2885 | - |
dc.citation.endPage | 2891 | - |
dc.type.rims | ART | - |
dc.type.docType | Article; Proceedings Paper | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.subject.keywordPlus | LDPC CODES | - |
dc.subject.keywordPlus | CONSTRUCTION | - |
dc.subject.keywordAuthor | girth | - |
dc.subject.keywordAuthor | low-density parity-check (LDPC) codes | - |
dc.subject.keywordAuthor | protograph | - |
dc.subject.keywordAuthor | protograph codes | - |
dc.subject.keywordAuthor | quasi--cyclic (QC) codes | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
94, Wausan-ro, Mapo-gu, Seoul, 04066, Korea02-320-1314
COPYRIGHT 2020 HONGIK UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.