© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

International Conference on Imaging, Signal Processing and Communications (ICISPC)

Hybrid Constrcution Method for Multi-kernel Polar Codes

Haotian Fan, Bing Zhu, Yanlong Zhao, Zhendong Yin

Published Jul 1, 2022• 1 citation

Abstract

Polar codes are the first class of error correction codes that achieve the Shannon channel capacity when their code length approaches infinity, but the code lengths of polar codes are limited to powers of 2. Therefore, multi-kernel polar codes are proposed, and their generator matrices are constructed from a variety of polarized kernels with different sizes. In this paper, we study the effect of different kernel orders on the channel polarization in the Gaussian approximation construction for multi-kernel polar codes. Besides, we study the minimum-distance spectrum of polarized kernels and the generator matrices of multi-kernel polar codes, and we calculate the minimum-distance spectrum for some larger kernels. We experimentally compare the advantages and disadvantages of the Gaussian approximation and minimum-distance construction. Finally, we propose a hybrid construction method which considers both the reliability and distance, and experimental results show that the proposed construction method outperforms the construction method that only considers distance and reliability.

DOI: 10.1109/icispc57208.2022.00036

Related papers

Exponents of Hybrid Multi-Kernel Polar Codes

Lei Cheng, Lijun Zhang, Qiang Sun

Multi-kernel polar codes are constructed from the Kronecker product. For ordinary multi-kernels, constituent polarizing matrices of the same stage are identical. However, in a stage, applying different constituent matrices based on channel property can further improve performance. This family of polar codes is defined as hybrid multi-kernel polar codes. Exponents of hybrid multi-kernels are analyzed. The matrix of a hybrid multi-kernel is generated by a Kronecker-like product operation, and so are partial distances. All exponents of hybrid multi-kernels take values between the maximum and the minimum exponents among all constituent matrices. Exponents are related to the error probability of the original channel and exhibit a trend of convergence as block-length increases. The convergence rate is also related to the original error probability.

International Symposium on Turbo Codes and Iterative Information Processing•Dec 1, 2018•3 citations

Minimum-Distance Based Construction of Multi-Kernel Polar Codes

Valerio Bioglio, Frédéric Gabry, Ingmar Land +1 more

In this paper, we propose a construction for multi-kernel polar codes based on the maximization of the minimum distance. Compared to the original construction based on density evolution, our new design shows particular advantages for short code lengths, where the polarization effect has less impact on the performance than the distances of the code. We introduce and compute the minimum-distance profile and provide a simple greedy algorithm for the code design. Compared to state-of-the-art punctured or shortened Arikan polar codes, multi-kernel polar codes with our new design show significantly improved error-rate performance.

arXiv:1701.07616•Globecom•Dec 1, 2017•41 citations

Hybrid Multi-Kernel Construction of Polar Codes

Lei Cheng, Wei Zhou, Lijun Zhang

A new family of multi-kernel polar codes are proposed. Instead of using identical matrices in each stage, assigning different constituent matrices to different virtual channels based on their properties will further improve polarization performance and error rate performance. Matrices with the same block-length can be classified based on Bhattacharyya parameters and a measure M (G) is proposed to compare their polarization performance. Construction framework and graph representation of hybrid multi-kernels are explicitly given. Numerical illustrations show that hybrid multi-kernels have better performance than previous multi-kernels.

IEEE Vehicular Technology Conference•Apr 1, 2019•8 citations

Multi-kernel construction of polar codes

Frédéric Gabry, Valerio Bioglio, Ingmar Land +1 more

We propose a generalized construction for binary polar codes based on mixing multiple kernels of different sizes in order to construct polar codes of block lengths that are not only powers of integers. This results in a multi-kernel polar code with very good performance while the encoding complexity remains low and the decoding follows the same general structure as for the original Arikan polar codes. The construction provides numerous practical advantages as more code lengths can be achieved without puncturing or shortening. We observe numerically that the error-rate performance of our construction outperforms state-of-the-art constructions using puncturing methods.

IEEE International Conference on Communications workshops•May 1, 2017•80 citations

Multi-Kernel Construction of Polar Codes

Frédéric Gabry, Valerio Bioglio, Ingmar Land +1 more

We propose a generalized construction for binary polar codes based on mixing multiple kernels of different sizes in order to construct polar codes of block lengths that are not only powers of integers. This results in a multi kernel polar code with very good performance while the encoding complexity remains low and the decoding follows the same general structure as for the original Arikan polar codes. The construction provides numerous practical advantages as more code lengths can be achieved without puncturing or shortening. We observe numerically that the error-rate performance of our construction outperforms stateof the-art constructions using puncturing methods.

arXiv:1612.06099•Dec 19, 2016•0 citations

Multi-Kernel Construction of Polar Codes

Frédéric Gabry, BIOGLIO V, LAND I +1 more

We propose a generalized construction for binary polar codes based on mixing multiple kernels of different sizes in order to construct polar codes of block lengths that are not only powers of integers. This results in a multi-kernel polar code with very good performance while the encoding complexity remains low and the decoding follows the same general structure as for the original Arikan polar codes. The construction provides numerous practical advantages as more code lengths can be achieved without puncturing or shortening. We observe numerically that the error-rate performance of our construction outperforms

•Jan 1, 2017•0 citations

Polar codes are the first class of error correction codes that achieve the Shannon channel capacity when their code length approaches infinity, but the code lengths of polar codes are limited to powers of 2. Therefore, multi-kernel polar codes are proposed, and their generator matrices are constructed from a variety of polarized kernels with different sizes. In this paper, we study the effect of different kernel orders on the channel polarization in the Gaussian approximation construction for multi-kernel polar codes. Besides, we study the minimum-distance spectrum of polarized kernels and the generator matrices of multi-kernel polar codes, and we calculate the minimum-distance spectrum for some larger kernels. We experimentally compare the advantages and disadvantages of the Gaussian approximation and minimum-distance construction. Finally, we propose a hybrid construction method which considers both the reliability and distance, and experimental results show that the proposed construction method outperforms the construction method that only considers distance and reliability.

Multi-kernel polar codes are constructed from the Kronecker product. For ordinary multi-kernels, constituent polarizing matrices of the same stage are identical. However, in a stage, applying different constituent matrices based on channel property can further improve performance. This family of polar codes is defined as hybrid multi-kernel polar codes. Exponents of hybrid multi-kernels are analyzed. The matrix of a hybrid multi-kernel is generated by a Kronecker-like product operation, and so are partial distances. All exponents of hybrid multi-kernels take values between the maximum and the minimum exponents among all constituent matrices. Exponents are related to the error probability of the original channel and exhibit a trend of convergence as block-length increases. The convergence rate is also related to the original error probability.

In this paper, we propose a construction for multi-kernel polar codes based on the maximization of the minimum distance. Compared to the original construction based on density evolution, our new design shows particular advantages for short code lengths, where the polarization effect has less impact on the performance than the distances of the code. We introduce and compute the minimum-distance profile and provide a simple greedy algorithm for the code design. Compared to state-of-the-art punctured or shortened Arikan polar codes, multi-kernel polar codes with our new design show significantly improved error-rate performance.

A new family of multi-kernel polar codes are proposed. Instead of using identical matrices in each stage, assigning different constituent matrices to different virtual channels based on their properties will further improve polarization performance and error rate performance. Matrices with the same block-length can be classified based on Bhattacharyya parameters and a measure M (G) is proposed to compare their polarization performance. Construction framework and graph representation of hybrid multi-kernels are explicitly given. Numerical illustrations show that hybrid multi-kernels have better performance than previous multi-kernels.

We propose a generalized construction for binary polar codes based on mixing multiple kernels of different sizes in order to construct polar codes of block lengths that are not only powers of integers. This results in a multi-kernel polar code with very good performance while the encoding complexity remains low and the decoding follows the same general structure as for the original Arikan polar codes. The construction provides numerous practical advantages as more code lengths can be achieved without puncturing or shortening. We observe numerically that the error-rate performance of our construction outperforms state-of-the-art constructions using puncturing methods.

We propose a generalized construction for binary polar codes based on mixing multiple kernels of different sizes in order to construct polar codes of block lengths that are not only powers of integers. This results in a multi kernel polar code with very good performance while the encoding complexity remains low and the decoding follows the same general structure as for the original Arikan polar codes. The construction provides numerous practical advantages as more code lengths can be achieved without puncturing or shortening. We observe numerically that the error-rate performance of our construction outperforms stateof the-art constructions using puncturing methods.

We propose a generalized construction for binary polar codes based on mixing multiple kernels of different sizes in order to construct polar codes of block lengths that are not only powers of integers. This results in a multi-kernel polar code with very good performance while the encoding complexity remains low and the decoding follows the same general structure as for the original Arikan polar codes. The construction provides numerous practical advantages as more code lengths can be achieved without puncturing or shortening. We observe numerically that the error-rate performance of our construction outperforms