Recursive Processing Algorithm for Low Complexity Decoding of Polar Codes With Large Kernels

被引：7

作者：

Trifonov, Peter ^{[1
]}

Karakchieva, Liudmila ^{[1
]}

机构：

[1] ITMO Univ, Fac Informat Technol & Programming, St Petersburg 197101, Russia

来源：

IEEE TRANSACTIONS ON COMMUNICATIONS | 2023年 / 71卷 / 09期

基金：

俄罗斯科学基金会;

关键词：

Kernel; Polar codes; Codes; Complexity theory; Maximum likelihood decoding; Viterbi algorithm; Symbols; large kernels; recursive maximum likelihood decoding; non-binary codes; CHANNEL POLARIZATION; DESIGN;

D O I：

10.1109/TCOMM.2023.3285773

中图分类号：

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

学科分类号：

0808 ; 0809 ;

摘要：

A reduced complexity algorithm is presented for computing the log-likelihood ratios (LLRs) arising in the successive cancellation (SC) decoder for polar codes with large kernels of arbitrary dimension. The proposed algorithm exploits a recursive trellis representation of the codes generated by submatrices of the polarization kernel and enables polar codes based on large kernels to be decoded with lower complexity compared to the codes based on the Arikan kernel with the same performance. Extensions to the case of non-binary kernels are presented.

引用

页码：5039 / 5050

页数：12

共 33 条

[1] Large Kernel Polar Codes With Efficient Window Decoding [J].

Abbasi, Fariba ;

Viterbo, Emanuele .

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2020, 69 (11) :14031-14036

[2] Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels [J].

Arikan, Erdal .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (07) :3051-3073

[3]

Balatsoukas-Stimming Alexios, 2014, 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), P3903, DOI 10.1109/ICASSP.2014.6854333

[4] Multi-Kernel Polar Codes: Concept and Design Principles [J].