REP Node Modification and Fast Decoding of Multi-Kernel Polar Codes Constructed with a New 5×5 Kernel

Abstract

Multi-kernel polar codes, which are constructed by different sizes of kernels make the length of the traditional polar code more flexible. In this paper, we extend the multi-kernel polar codes to 5×5 kernels including kernel design, code design, and fast decoding. First, we construct a new 5×5 kernel with the maximum polarization rate. The first row of this kernel is an all-one vector, which enable us to find the relation between node modification and distance property of multi-kernel polar codes. Second, we modify the repetition (REP) nodes to the new 5×5 kernel, which can increase the distance property of the constructed polar codes, improve the decoding performance and reduce memory requirements during the fast decoding. In addition, we find our REP node modification can be generalized to multi-kernel polar codes when the first row of the used kernels is all-one vector. Third, we prove the four kinds of basic nodes (Rate-1 node, Rate-0 nodes, Repetition (REP) nodes, and Single-Parity check (SPC) nodes) of fast decoding are suitable for the new kernel. Moreover, we generalize the Generalized Parity-Check (G-PC) nodes and the Generalized Repetition (G-REP) nodes, which are suitable for multi-kernel polar codes constructed by any size of kernels and any order of kernels. By simulations, we show that our modification improves the error-rate performance of the fast decoding. Meanwhile, the fast decoding of our multi-kernel polar codes has at least 68.4% latency reduction compared with the traditional SC decoder in all cases considered where code lengths are 80, 135, 400, and 675.