针对极化码在中短码长时纠错性能的不足,提出了一种基于错误集的极化码改进串行抵消列表(Successive Cancellation List of Polar Codes Based on Error Set,ES-SCL)译码算法。该算法首先根据极化码的信道特性构造错误集,在极化码编码...针对极化码在中短码长时纠错性能的不足,提出了一种基于错误集的极化码改进串行抵消列表(Successive Cancellation List of Polar Codes Based on Error Set,ES-SCL)译码算法。该算法首先根据极化码的信道特性构造错误集,在极化码编码时根据错误集中的元素设置奇偶校验(Parity Check,PC)位,其余位置则放置信息比特和冻结比特,译码器在译码PC位时,每条路径通过校验函数得到PC位的比特估计,不执行路径分裂和剪枝,其余位置则执行SCL译码。仿真结果表明,在加性高斯白噪声信道下,当码长为512,码率为0.5,误块率为10^(-5),最大译码列表数为8时,相较于PC-PSCL译码算法以及CA-SCL译码算法,所提出的ES-SCL译码算法获得了约0.18和0.15 dB的增益;当码长为256,码率为0.5,误码率为10^(-5),最大译码列表数为8时,相较于CA-SCL,PC-PSCL译码算法,获得了约0.3和0.35 dB的增益;此外,采用部分比特分裂译码的ES-SCL译码算法可以在误块率与PC-PSCL译码算法几乎相同的情况下,减少约50%的排序次数,具有更低的译码复杂度。展开更多
Binary Polar Codes (BPCs) have advantages of high-efficiency and capacity-achieving but suffer from large latency due to the Successive-Cancellation List (SCL) decoding. Non-Binary Polar Codes (NBPCs) have been invest...Binary Polar Codes (BPCs) have advantages of high-efficiency and capacity-achieving but suffer from large latency due to the Successive-Cancellation List (SCL) decoding. Non-Binary Polar Codes (NBPCs) have been investigated to obtain the performance gains and reduce latency under the implementation of parallel architectures for multi-bit decoding. However, most of the existing works only focus on the Reed-Solomon matrix-based NBPCs and the probability domain-based non-binary polar decoding, which lack flexible structure and have a large computation amount in the decoding process, while little attention has been paid to general non-binary kernel-based NBPCs and Log-Likelihood Ratio (LLR) based decoding methods. In this paper, we consider a scheme of NBPCs with a general structure over GF(2m). Specifically, we pursue a detailed Monte-Carlo simulation implementation to determine the construction for proposed NBPCs. For non-binary polar decoding, an SCL decoding based on LLRs is proposed for NBPCs, which can be implemented with non-binary kernels of arbitrary size. Moreover, we propose a Perfect Polarization-Based SCL (PPB-SCL) algorithm based on LLRs to reduce decoding complexity by deriving a new update function of path metric for NBPCs and eliminating the path splitting process at perfect polarized (i.e., highly reliable) positions. Simulation results show that the bit error rate of the proposed NBPCs significantly outperforms that of BPCs. In addition, the proposed PPB-SCL decoding obtains about a 40% complexity reduction of SCL decoding for NBPCs.展开更多
Polar codes represent one of the major breakthroughs in 5G standard,and have been proven to be able to achieve the symmetric capacity of binary-input discrete memoryless channels using the successive cancellation list...Polar codes represent one of the major breakthroughs in 5G standard,and have been proven to be able to achieve the symmetric capacity of binary-input discrete memoryless channels using the successive cancellation list(SCL)decoding algorithm.However,the SCL algorithm suffers from a large amount of memory overhead.This paper proposes an adaptive simplified decoding algorithm for multiple cyclic redundancy check(CRC)polar codes.Simulation results show that the proposed method can reduce the decoding complexity and memory space.It can also acquire the performance gain in the low signal to noise ratio region.展开更多
针对基于路径分裂策略辅助极化码串行抵消列表(Path Splitting Selecting strategy based on Search Set under the Successive Cancellation List,PSS-SS-SCL)译码算法性能的不足,提出了一种利用增强型奇偶校验码改进PSSSS-SCL译码算法...针对基于路径分裂策略辅助极化码串行抵消列表(Path Splitting Selecting strategy based on Search Set under the Successive Cancellation List,PSS-SS-SCL)译码算法性能的不足,提出了一种利用增强型奇偶校验码改进PSSSS-SCL译码算法的EPC-MS-SCL(Enhanced Parity Check and Monte Carlo Segment aided Successive Cancellation List)译码算法.该算法在极化码编码阶段对信息序列做分段处理,在每段末尾添加增强型奇偶校验码,译码器仅在译码搜索集内元素时进行路径分裂,其余元素直接执行硬判决译码,并在译码完一段序列后立即对该段进行校验,仅保留通过校验的路径,从而减少了错误路径对正确路径的竞争,使正确路径保留到译码结束的概率增加,改善了译码性能,同时减少了译码列表数,使得译码复杂度更低.仿真结果表明,与PSS-SS-SCL译码算法相比较,所提出算法能在一定程度上改善其性能增益且具有更低的译码复杂度.展开更多
文摘针对极化码在中短码长时纠错性能的不足,提出了一种基于错误集的极化码改进串行抵消列表(Successive Cancellation List of Polar Codes Based on Error Set,ES-SCL)译码算法。该算法首先根据极化码的信道特性构造错误集,在极化码编码时根据错误集中的元素设置奇偶校验(Parity Check,PC)位,其余位置则放置信息比特和冻结比特,译码器在译码PC位时,每条路径通过校验函数得到PC位的比特估计,不执行路径分裂和剪枝,其余位置则执行SCL译码。仿真结果表明,在加性高斯白噪声信道下,当码长为512,码率为0.5,误块率为10^(-5),最大译码列表数为8时,相较于PC-PSCL译码算法以及CA-SCL译码算法,所提出的ES-SCL译码算法获得了约0.18和0.15 dB的增益;当码长为256,码率为0.5,误码率为10^(-5),最大译码列表数为8时,相较于CA-SCL,PC-PSCL译码算法,获得了约0.3和0.35 dB的增益;此外,采用部分比特分裂译码的ES-SCL译码算法可以在误块率与PC-PSCL译码算法几乎相同的情况下,减少约50%的排序次数,具有更低的译码复杂度。
基金supported in part by the National Natural Science Foundation of China under Grant 61401407in part by the Fundamental Research Funds for the Central Universities under Grant CUC2019B067.
文摘Binary Polar Codes (BPCs) have advantages of high-efficiency and capacity-achieving but suffer from large latency due to the Successive-Cancellation List (SCL) decoding. Non-Binary Polar Codes (NBPCs) have been investigated to obtain the performance gains and reduce latency under the implementation of parallel architectures for multi-bit decoding. However, most of the existing works only focus on the Reed-Solomon matrix-based NBPCs and the probability domain-based non-binary polar decoding, which lack flexible structure and have a large computation amount in the decoding process, while little attention has been paid to general non-binary kernel-based NBPCs and Log-Likelihood Ratio (LLR) based decoding methods. In this paper, we consider a scheme of NBPCs with a general structure over GF(2m). Specifically, we pursue a detailed Monte-Carlo simulation implementation to determine the construction for proposed NBPCs. For non-binary polar decoding, an SCL decoding based on LLRs is proposed for NBPCs, which can be implemented with non-binary kernels of arbitrary size. Moreover, we propose a Perfect Polarization-Based SCL (PPB-SCL) algorithm based on LLRs to reduce decoding complexity by deriving a new update function of path metric for NBPCs and eliminating the path splitting process at perfect polarized (i.e., highly reliable) positions. Simulation results show that the bit error rate of the proposed NBPCs significantly outperforms that of BPCs. In addition, the proposed PPB-SCL decoding obtains about a 40% complexity reduction of SCL decoding for NBPCs.
基金supported by the National Key R&D Program of China(2018YFB2101300)the National Science Foundation of China(61973056)
文摘Polar codes represent one of the major breakthroughs in 5G standard,and have been proven to be able to achieve the symmetric capacity of binary-input discrete memoryless channels using the successive cancellation list(SCL)decoding algorithm.However,the SCL algorithm suffers from a large amount of memory overhead.This paper proposes an adaptive simplified decoding algorithm for multiple cyclic redundancy check(CRC)polar codes.Simulation results show that the proposed method can reduce the decoding complexity and memory space.It can also acquire the performance gain in the low signal to noise ratio region.
文摘针对基于路径分裂策略辅助极化码串行抵消列表(Path Splitting Selecting strategy based on Search Set under the Successive Cancellation List,PSS-SS-SCL)译码算法性能的不足,提出了一种利用增强型奇偶校验码改进PSSSS-SCL译码算法的EPC-MS-SCL(Enhanced Parity Check and Monte Carlo Segment aided Successive Cancellation List)译码算法.该算法在极化码编码阶段对信息序列做分段处理,在每段末尾添加增强型奇偶校验码,译码器仅在译码搜索集内元素时进行路径分裂,其余元素直接执行硬判决译码,并在译码完一段序列后立即对该段进行校验,仅保留通过校验的路径,从而减少了错误路径对正确路径的竞争,使正确路径保留到译码结束的概率增加,改善了译码性能,同时减少了译码列表数,使得译码复杂度更低.仿真结果表明,与PSS-SS-SCL译码算法相比较,所提出算法能在一定程度上改善其性能增益且具有更低的译码复杂度.
