.png){kind=icon}
返回
A Mapping Shortening Algorithm for Polar Codes
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2019.2926739.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Shortening is a common way to achieve rate-compatible polar codes. The existing shortening algorithms select shortened bits merely according to the structure of the generator matrix in order to make them known by the receiver. In this paper, we take into account the effect that the shortening has on the capacity of split channels and propose a shortening capacity mapping criterion. Based on the proposed mapping criterion, a mapping shortening (MS) algorithm is proposed. We theoretically prove that the MS algorithm can ensure that the proposed mapping criterion can be adopted reasonably and the shortened bits can be known by the receiver. In addition, the MS algorithm is proved to have the same order of complexity as existing shortening algorithms. What's more, we demonstrate the superiority of the MS algorithm over existing shortened algorithms from the perspective of channel capacity. Finally, the simulation results show that the MS algorithm has a significant advantage over existing shortening algorithms for the bit error rate (BER) and frame error rate (FER) performance under high code rates.
Keyword:
Polar codes
shortening
gaussian approximation
successive cancellation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
Comparative Evaluation of Novel 177Lu-Labeled PNA Probes for Affibody-Mediated PNA-Based Pretargeting.png)
CancersOAAI
CancersIF0
OAAI分享收藏
查看更多内容