Capacity-Achieving Rate-Compatible Polar Codes
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hong, Song nam | - |
dc.contributor.author | Hui, Dennis | - |
dc.contributor.author | Maric, Ivana | - |
dc.date.accessioned | 2021-07-30T05:17:12Z | - |
dc.date.available | 2021-07-30T05:17:12Z | - |
dc.date.created | 2021-05-14 | - |
dc.date.issued | 2017-12 | - |
dc.identifier.issn | 0018-9448 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/3952 | - |
dc.description.abstract | A method of constructing rate-compatible polar codes that are capacity achieving at multiple code rates with low-complexity sequential decoders is presented. The underlying idea of the construction exploits certain common characteristics of polar codes that are optimized for a sequence of successively degraded channels. The proposed code consists of parallel concatenation of multiple polar codes with information-bit divider at the input of each polar encoder. Thus, it is referred to as parallel concatenated polar (PCP) codes. A lower-rate PCP code is simply constructed by adding more constituent polar codes, which enables incremental retransmissions at different rates in order to adapt to channel conditions. Due to the length limitation of polar codes, the PCP code can only support a restricted set of rates that is characterized by the size of the kernel when conventional polar codes are used. To overcome this limitation, punctured polar codes, which provide more flexibility on blocklength by controlling a puncturing fraction, are considered as constituent codes. The existence of capacity-achieving punctured polar codes for any given puncturing fraction is proven. Using such punctured polar codes as constituent codes, it is shown that the proposed PCP code is capacity achieving for an arbitrary sequence of rates and for any class of degraded channels. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
dc.title | Capacity-Achieving Rate-Compatible Polar Codes | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Hong, Song nam | - |
dc.identifier.doi | 10.1109/TIT.2017.2756668 | - |
dc.identifier.scopusid | 2-s2.0-85030765220 | - |
dc.identifier.wosid | 000416211900002 | - |
dc.identifier.bibliographicCitation | IEEE TRANSACTIONS ON INFORMATION THEORY, v.63, no.12, pp.7620 - 7632 | - |
dc.relation.isPartOf | IEEE TRANSACTIONS ON INFORMATION THEORY | - |
dc.citation.title | IEEE TRANSACTIONS ON INFORMATION THEORY | - |
dc.citation.volume | 63 | - |
dc.citation.number | 12 | - |
dc.citation.startPage | 7620 | - |
dc.citation.endPage | 7632 | - |
dc.type.rims | ART | - |
dc.type.docType | 정기학술지(Article(Perspective Article포함)) | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | Y | - |
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 | SCHEME | - |
dc.subject.keywordAuthor | Polar codes | - |
dc.subject.keywordAuthor | capacity-achieving codes | - |
dc.subject.keywordAuthor | rate-compatibility | - |
dc.subject.keywordAuthor | retransmissions | - |
dc.subject.keywordAuthor | HARQ-IR | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/8049513 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
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.