DC Field | Value | Language |
---|---|---|
dc.contributor.author | Shin, DM | - |
dc.contributor.author | Lim, SC | - |
dc.contributor.author | Yang, K | - |
dc.date.accessioned | 2016-03-31T08:27:03Z | - |
dc.date.available | 2016-03-31T08:27:03Z | - |
dc.date.created | 2013-09-27 | - |
dc.date.issued | 2013-07 | - |
dc.identifier.issn | 0090-6778 | - |
dc.identifier.other | 2013-OAK-0000028081 | - |
dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/15333 | - |
dc.description.abstract | Length-compatible polar codes are a class of polar codes which can support a wide range of lengths with a single pair of encoder and decoder. In this paper we propose a method to construct length-compatible polar codes by employing the reduction of the 2(n) x 2(n) polarizing matrix proposed by Arikan. The conditions under which a reduced matrix becomes a polarizing matrix supporting a polar code of a given length are first analyzed. Based on these conditions, length-compatible polar codes are constructed in a suboptimal way by codeword-puncturing and information-refreezing processes. They have low encoding and decoding complexity since they can be encoded and decoded in a similar way as a polar code of length 2(n). Numerical results show that length-compatible polar codes designed by the proposed method provide a performance gain of about 1.0-5.0 dB over those obtained by random puncturing when successive cancellation decoding is employed. | - |
dc.description.statementofresponsibility | X | - |
dc.language | English | - |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
dc.relation.isPartOf | IEEE TRANSACTIONS ON COMMUNICATIONS | - |
dc.subject | Polar codes | - |
dc.subject | polarizing matrix | - |
dc.subject | density evolution | - |
dc.subject | frozen bit | - |
dc.subject | matrix reduction | - |
dc.subject | puncturing | - |
dc.title | Design of Length-Compatible Polar Codes Based on the Reduction of Polarizing Matrices | - |
dc.type | Article | - |
dc.contributor.college | 전자전기공학과 | - |
dc.identifier.doi | 10.1109/TCOMM.2013.052013.120543 | - |
dc.author.google | Shin, DM | - |
dc.author.google | Lim, SC | - |
dc.author.google | Yang, K | - |
dc.relation.volume | 61 | - |
dc.relation.issue | 7 | - |
dc.relation.startpage | 2593 | - |
dc.relation.lastpage | 2599 | - |
dc.contributor.id | 10055166 | - |
dc.relation.journal | IEEE TRANSACTIONS ON COMMUNICATIONS | - |
dc.relation.index | SCI급, SCOPUS 등재논문 | - |
dc.relation.sci | SCI | - |
dc.collections.name | Journal Papers | - |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | IEEE TRANSACTIONS ON COMMUNICATIONS, v.61, no.7, pp.2593 - 2599 | - |
dc.identifier.wosid | 000322451800001 | - |
dc.date.tcdate | 2019-01-01 | - |
dc.citation.endPage | 2599 | - |
dc.citation.number | 7 | - |
dc.citation.startPage | 2593 | - |
dc.citation.title | IEEE TRANSACTIONS ON COMMUNICATIONS | - |
dc.citation.volume | 61 | - |
dc.contributor.affiliatedAuthor | Yang, K | - |
dc.identifier.scopusid | 2-s2.0-84881136899 | - |
dc.description.journalClass | 1 | - |
dc.description.journalClass | 1 | - |
dc.description.wostc | 24 | - |
dc.description.scptc | 21 | * |
dc.date.scptcdate | 2018-05-121 | * |
dc.type.docType | Article | - |
dc.subject.keywordAuthor | Polar codes | - |
dc.subject.keywordAuthor | polarizing matrix | - |
dc.subject.keywordAuthor | density evolution | - |
dc.subject.keywordAuthor | frozen bit | - |
dc.subject.keywordAuthor | matrix reduction | - |
dc.subject.keywordAuthor | puncturing | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.relation.journalWebOfScienceCategory | Telecommunications | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Engineering | - |
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.