Article
Cited 24 time in 
Cited 34 time in 
Cited 34 time in
Metadata Downloads
Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Myung, S | - |
| dc.contributor.author | Yang, KC | - |
| dc.contributor.author | Kim, Y | - |
| dc.date.accessioned | 2016-04-01T01:54:22Z | - |
| dc.date.available | 2016-04-01T01:54:22Z | - |
| dc.date.created | 2009-08-18 | - |
| dc.date.issued | 2006-06 | - |
| dc.identifier.issn | 1089-7798 | - |
| dc.identifier.other | 2006-OAK-0000006007 | - |
| dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/23969 | - |
| dc.description.abstract | In this paper we present two simple methods to construct a quasi-cyclic LDPC (QC-LDPC) code of larger length by lifting a given QC-LDPC code. We show that its girth is always larger than or equal to that of the given QC-LDPC code. Applying the methods recursively, it is possible to construct a sequence of QC-LDPC codes generated from a single exponent matrix by proper floor or modulo operations. Simulation results show that they have no serious performance degradation, as compared with randomly constructed LDPC codes. | - |
| dc.description.statementofresponsibility | X | - |
| dc.language | English | - |
| dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGI | - |
| dc.relation.isPartOf | IEEE COMMUNICATIONS LETTERS | - |
| dc.subject | block-cycle | - |
| dc.subject | circulant permutation matrix | - |
| dc.subject | lifting | - |
| dc.subject | low-density parity-check (LDPC) codes | - |
| dc.subject | quasi-cyclic | - |
| dc.subject | PARITY-CHECK CODES | - |
| dc.subject | CONSTRUCTION | - |
| dc.subject | MATRICES | - |
| dc.title | Lifting methods for quasi-cyclic LDPC codes | - |
| dc.type | Article | - |
| dc.contributor.college | 전자전기공학과 | - |
| dc.identifier.doi | 10.1109/LCOMM.2006.1638625 | - |
| dc.author.google | Myung, S | - |
| dc.author.google | Yang, KC | - |
| dc.author.google | Kim, Y | - |
| dc.relation.volume | 10 | - |
| dc.relation.issue | 6 | - |
| dc.relation.startpage | 489 | - |
| dc.relation.lastpage | 491 | - |
| 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.10, no.6, pp.489 - 491 | - |
| dc.identifier.wosid | 000238426700025 | - |
| dc.date.tcdate | 2019-01-01 | - |
| dc.citation.endPage | 491 | - |
| dc.citation.number | 6 | - |
| dc.citation.startPage | 489 | - |
| dc.citation.title | IEEE COMMUNICATIONS LETTERS | - |
| dc.citation.volume | 10 | - |
| dc.contributor.affiliatedAuthor | Yang, KC | - |
| dc.identifier.scopusid | 2-s2.0-33745225452 | - |
| dc.description.journalClass | 1 | - |
| dc.description.journalClass | 1 | - |
| dc.description.wostc | 17 | - |
| dc.type.docType | Article | - |
| dc.subject.keywordPlus | PARITY-CHECK CODES | - |
| dc.subject.keywordPlus | DENSITY | - |
| dc.subject.keywordPlus | CONSTRUCTION | - |
| dc.subject.keywordAuthor | block-cycle | - |
| dc.subject.keywordAuthor | circulant permutation matrix | - |
| dc.subject.keywordAuthor | lifting | - |
| 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.