DC Field | Value | Language |
---|---|---|
dc.contributor.author | Myung, S | - |
dc.contributor.author | Yang, KC | - |
dc.date.accessioned | 2016-04-01T02:05:32Z | - |
dc.date.available | 2016-04-01T02:05:32Z | - |
dc.date.created | 2009-08-19 | - |
dc.date.issued | 2005-09 | - |
dc.identifier.issn | 1089-7798 | - |
dc.identifier.other | 2005-OAK-0000005406 | - |
dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/24396 | - |
dc.description.abstract | In this paper we propose a method of constructing quasi-cyclic low-density parity-check (QC-LDPC) codes of large length by combining QC-LDPC codes of small length as their component codes, via the Chinese Remainder Theorem. The girth of the QC-LDPC codes obtained by the proposed method is always larger than or equal to that of each component code. By applying the method to array codes, we present a family of high-rate regular QC-LDPC codes with no 4-cycles. Simulation results show that they have almost the same performance as random regular LDPC codes. | - |
dc.description.statementofresponsibility | X | - |
dc.language | English | - |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGI | - |
dc.relation.isPartOf | IEEE COMMUNICATIONS LETTERS | - |
dc.subject | Chinese Remainder Theorem | - |
dc.subject | circulant permutation matrix | - |
dc.subject | low-density parity-check (LDPC) codes | - |
dc.subject | quasi-cyclic | - |
dc.subject | PARITY-CHECK CODES | - |
dc.subject | MATRICES | - |
dc.title | A combining method of quasi-cyclic LDPC codes by the chinese remainder theorem | - |
dc.type | Article | - |
dc.contributor.college | 전자전기공학과 | - |
dc.identifier.doi | 10.1109/LCOMM.2005.1506715 | - |
dc.author.google | Myung, S | - |
dc.author.google | Yang, KC | - |
dc.relation.volume | 9 | - |
dc.relation.issue | 9 | - |
dc.relation.startpage | 823 | - |
dc.relation.lastpage | 825 | - |
dc.contributor.id | 10055166 | - |
dc.relation.journal | IEEE COMMUNICATIONS LETTERS | - |
dc.relation.index | SCI급, SCOPUS 등재논문 | - |
dc.relation.sci | SCI | - |
dc.collections.name | Journal Papers | - |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | IEEE COMMUNICATIONS LETTERS, v.9, no.9, pp.823 - 825 | - |
dc.identifier.wosid | 000231919200019 | - |
dc.date.tcdate | 2019-01-01 | - |
dc.citation.endPage | 825 | - |
dc.citation.number | 9 | - |
dc.citation.startPage | 823 | - |
dc.citation.title | IEEE COMMUNICATIONS LETTERS | - |
dc.citation.volume | 9 | - |
dc.contributor.affiliatedAuthor | Yang, KC | - |
dc.identifier.scopusid | 2-s2.0-27844564305 | - |
dc.description.journalClass | 1 | - |
dc.description.journalClass | 1 | - |
dc.description.wostc | 32 | - |
dc.type.docType | Article | - |
dc.subject.keywordAuthor | Chinese Remainder Theorem | - |
dc.subject.keywordAuthor | circulant permutation matrix | - |
dc.subject.keywordAuthor | low-density parity-check (LDPC) codes | - |
dc.subject.keywordAuthor | quasi-cyclic | - |
dc.relation.journalWebOfScienceCategory | Telecommunications | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Telecommunications | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
library@postech.ac.kr Tel: 054-279-2548
Copyrights © by 2017 Pohang University of Science ad Technology All right reserved.