Polar Code Constructions Based on LLR Evolution

被引：35

作者：

Qin, Minghai ^{[1
]}

Guo, Jing ^{[2
]}

Bhatia, Aman ^{[3
]}

Guillen i Fabregas, Albert ^{[4
,5
,6
]}

Siegel, Paul H. ^{[7
,8
]}

机构：

[1] WDC Res, Milpitas, CA 95035 USA

[2] Univ Cambridge, Dept Engn, Cambridge CB2 1TN, England

[3] SK Hynix Memory Solut, San Jose, CA 95134 USA

[4] Univ Pompeu Fabra, Dept Informat & Commun Technol, Barcelona 08018, Spain

[5] Inst Catalana Recerca & Estudis Avancats, Barcelona 08010, Spain

[6] Univ Cambridge, Dept Engn, Cambridge CB2 1PZ, England

[7] Univ Calif San Diego, Dept Elect & Comp Engn, La Jolla, CA 92093 USA

[8] Univ Calif San Diego, Ctr Memory & Recording Res, La Jolla, CA 92093 USA

来源：

IEEE COMMUNICATIONS LETTERS | 2017年 / 21卷 / 06期

基金：

欧洲研究理事会; 美国国家科学基金会;

关键词：

Polar codes; belief propagation decoding; successive cancellation list decoding;

D O I：

10.1109/LCOMM.2017.2656126

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

Polar code constructions based on mutual information or Bhattacharyya parameters of bit-channels are intended for hard-output successive cancellation (SC) decoders, and thus might not be well designed for use with other decoders, such as soft-output belief propagation (BP) decoders or successive cancellation list (SCL) decoders. In this letter, we use the evolution of messages, i.e., log-likelihood ratios, of unfrozen bits during iterative BP decoding of polar codes to identify weak bit-channels, and then modify the conventional polar code construction by swapping these bit-channels with strong frozen bit-channels. The modified codes show improved performance not only under BP decoding, but also under SCL decoding. The code modification is shown to reduce the number of low-weight codewords, with and without CRC concatenation.

引用

页码：1221 / 1224

页数：4

共 14 条

[1] A performance comparison of polar codes and reed-muller codes [J].