Discover the SciOpen Platform and Achieve Your Research Goals with Ease.
Search articles, authors, keywords, DOl and etc.
Compared to the successive cancellation (SC)-based decoding algorithms, the sphere decoding (SD) algorithm can achieve better performance with reduced computational complexity, especially for short polar codes. In this paper, we propose a new method to construct the binary polar codes with the modified multiplicative repetition (MR)-based matrix. Different from the original construction, we first design a
P. Wang, L. Yin, and J. Lu, Efficient helicopter-satellite communication scheme based on check-hybrid LDPC coding, Tsinghua Science and Technology, vol. 23, no. 3, pp. 323–332, 2018.
C. Sun, Z. Fei, and D. Jia, Secure transmission scheme for parallel relay channels based on polar coding, Tsinghua Science and Technology, vol. 23, no. 3, pp. 357–365, 2018.
C. Li, H. Chen, and Z. Wang, Two-stage constructions for the rate-compatible shortened polar codes, Tsinghua Science and Technology, vol. 28, no. 2, pp. 269–282, 2023.
I. Tal and A. Vardy, List decoding of polar codes, IEEE Transactions on Information Theory, vol. 61, no. 5, pp. 2213–2226, 2015.
K. Niu and K. Chen, CRC-aided decoding of polar codes, IEEE Communications Letters, vol. 16, no. 10, pp. 1668–1671, 2012.
Q. Zeng, Q. Zhou, and X. He, Polar codes: Encoding/Decoding and rate-compatible jointly design for HARQ system, Intelligent and Converged Networks, vol. 2, no. 4, pp. 334–346, 2021.
J. Piao, J. Dai, and K. Niu, CRC-aided sphere decoding for short polar codes, IEEE Communications Letters, vol. 23, no. 2, pp. 210–213, 2019.
R. Mori and T. Tanaka, Source and channel polarization over finite fields and Reed-Solomon matrices, IEEE Transactions on Information Theory, vol. 60, no. 5, pp. 2720–2736, 2014.
A. Eslami and H. Pishro-Nik, On finite-length performance of polar codes: Stopping sets, error floor, and concatenated design, IEEE Transactions on Communications, vol. 61, no. 3, pp. 919–929, 2013.
E. Arikan, Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels, IEEE Transactions on Information Theory, vol. 55, no. 7, pp. 3051–3073, 2009.
R. Mori and T. Tanaka, Performance of polar codes with the construction using density evolution, IEEE Communications Letters, vol. 13, no. 7, pp. 519–521, 2009.
P. Trifonov, Efficient design and decoding of polar codes, IEEE Transactions on Communications, vol. 60, no. 11, pp. 3221–3227, 2012.
The articles published in this open access journal are distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/).