Sphere Decoding for Binary Polar Codes with the Modified Multiplicative Repetition Construction

被引:0
作者
Chen, Haiqiang [1 ]
Liu, Yuanbo [1 ]
Dang, Shuping [2 ]
Li, Qingnian [3 ]
Sun, Youming [1 ]
Li, Xiangcheng [1 ]
机构
[1] Guangxi Univ, Sch Comp Elect & Informat, Nanning 530004, Peoples R China
[2] Univ Bristol, Sch Elect Elect & Mech Engn, Bristol BS8 1TR, England
[3] Nanning Univ, Informat & Engn Coll, Nanning 530004, Peoples R China
来源
TSINGHUA SCIENCE AND TECHNOLOGY | 2025年 / 30卷 / 03期
基金
中国国家自然科学基金;
关键词
Monte Carlo methods; Codes; Simulation; Performance gain; Benchmark testing; Generators; Decoding; Polar codes; Kernel; Computational complexity; polar codes; sphere decoding; generator matrix; multiplicative repetition; Monte-Carlo method; CHANNEL POLARIZATION; PERFORMANCE; SCHEME;
D O I
10.26599/TST.2024.9010030
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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 2x2 q-ary kernel to guarantee the single-level polarization effect. Then, by replacing the new-designed binary companion matrix, a novel strategy is further developed to enhance the polarization in the bit level, resulting in a better distance property. Finally, the SD-based Monte-Carlo (SDMC) method is used to construct MR-based binary polar codes, while the resulting codes without the butterfly pattern are decoded by the SD algorithm. Simulation results show that the proposed method with the SD algorithm can achieve a maximum performance gain of 0.27 dB compared to the original method with slightly lower complexity.
引用
收藏
页码:1229 / 1236
页数:8
相关论文
共 20 条
  • [1] [Anonymous], 2018, TS38.212 V.15.1.0, NR
  • [2] Multiplexing and channel coding
  • [3] Channel Polarization: A Method for Constructing Capacity-Achieving Codes
    Arikan, Erdal
    [J]. 2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-6, 2008, : 1173 - 1177
  • [4] Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
    Arikan, Erdal
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (07) : 3051 - 3073
  • [5] Chen P., 2023, Journal of Information and Intelligence, V1, P3653
  • [6] On Finite-Length Performance of Polar Codes: Stopping Sets, Error Floor, and Concatenated Design
    Eslami, A.
    Pishro-Nik, H.
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2013, 61 (03) : 919 - 929
  • [7] Guo J, 2015, IEEE INT SYMP INFO, P236, DOI 10.1109/ISIT.2015.7282452
  • [8] Kahraman S., 2012, Proceedings of the 2012 IEEE International Symposium on Information Theory - ISIT, P1967, DOI 10.1109/ISIT.2012.6283643
  • [9] Two-Stage Constructions for the Rate-Compatible Shortened Polar Codes
    Li, Chunjie
    Chen, Haiqiang
    Wang, Zelin
    Sun, Youming
    Li, Xiangcheng
    Qin, Tuanfa
    [J]. TSINGHUA SCIENCE AND TECHNOLOGY, 2023, 28 (02): : 269 - 282
  • [10] Lidl R., 1994, Introduction to finite fields and their applications