Bit-Level Construction for Multiplicative-Repetition-Based Non-Binary Polar Codes.

IF 2.1 3区物理与天体物理 Q2 PHYSICS, MULTIDISCIPLINARY

Entropy Pub Date : 2025-04-02 DOI:10.3390/e27040377

Rongchi Xu, Peiyao Chen, Ling Liu, Min Zhu, Baoming Bai

{"title":"Bit-Level Construction for Multiplicative-Repetition-Based Non-Binary Polar Codes.","authors":"Rongchi Xu, Peiyao Chen, Ling Liu, Min Zhu, Baoming Bai","doi":"10.3390/e27040377","DOIUrl":null,"url":null,"abstract":"In this paper, we discuss non-binary polar codes using a 2×2 matrix over a Galois field GF(2q) as the kernel. Conventional construction of non-binary polar codes divides the synthesized channels into frozen channels and information channels. Each information channel carries one symbol, i.e., q bits. However, there are many middle channels with insufficient polarization, which cannot carry one symbol of q bits but only i bits, 1≤i<q,i∈Z, at finite block length. In this paper, we consider bit-level construction for multiplicative repetition (MR)-based non-binary polar codes and propose a bit-level construction based on the two following methods. We first calculate the error probability and channel capacity lower bound of each synthesized channel based on the channel degradation method, and then determine both the number and index of the carried bits for each synthesized channel according to the symbol error probability and capacity. To reduce complexity, we also introduce a Monte-Carlo method. We compute the error probability of each synthesized channel carrying i information bits and select the optimal construction that can minimize the union bound of the error probability. Finally, an improved construction-based probabilistic shaping method for MR-based non-binary polar codes is considered. Simulation results show that the proposed construction significantly improved the decoding performance compared with the conventional construction scheme.","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"27 4","pages":""},"PeriodicalIF":2.1000,"publicationDate":"2025-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12026330/pdf/","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Entropy","FirstCategoryId":"101","ListUrlMain":"https://doi.org/10.3390/e27040377","RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"PHYSICS, MULTIDISCIPLINARY","Score":null,"Total":0}

引用次数: 0

Abstract

In this paper, we discuss non-binary polar codes using a 2×2 matrix over a Galois field GF(2q) as the kernel. Conventional construction of non-binary polar codes divides the synthesized channels into frozen channels and information channels. Each information channel carries one symbol, i.e., q bits. However, there are many middle channels with insufficient polarization, which cannot carry one symbol of q bits but only i bits, 1≤ii information bits and select the optimal construction that can minimize the union bound of the error probability. Finally, an improved construction-based probabilistic shaping method for MR-based non-binary polar codes is considered. Simulation results show that the proposed construction significantly improved the decoding performance compared with the conventional construction scheme.

查看原文本刊更多论文

基于乘法重复的非二进制极码的位级构造。

本文讨论了以伽罗瓦域GF（2q）上的2×2矩阵为核的非二进制极码。传统的非二进制极码构造将合成信道分为冻结信道和信息信道。每个信息通道携带一个符号，即q位。然而，存在许多极化不足的中间信道，它们不能携带一个q位的符号，只能携带i位，1≤ii个信息位，并选择能够使错误概率的并界最小的最优结构。最后，提出了一种改进的基于构造的概率整形方法。仿真结果表明，与传统结构方案相比，该结构显著提高了译码性能。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Entropy PHYSICS, MULTIDISCIPLINARY-

CiteScore

4.90

自引率

11.10%

发文量

1580

审稿时长

21.05 days

期刊介绍： Entropy (ISSN 1099-4300), an international and interdisciplinary journal of entropy and information studies, publishes reviews, regular research papers and short notes. Our aim is to encourage scientists to publish as much as possible their theoretical and experimental details. There is no restriction on the length of the papers. If there are computation and the experiment, the details must be provided so that the results can be reproduced.