针对基于路径分裂策略辅助极化码串行抵消列表(Path Splitting Selecting strategy based on Search Set under the Successive Cancellation List,PSS-SS-SCL)译码算法性能的不足,提出了一种利用增强型奇偶校验码改进PSS-SS-SCL译码算法的EPC-MS-SCL(Enhanced Parity Check and Monte Carlo Segment aided Successive Cancellation List)译码算法.该算法在极化码编码阶段对信息序列做分段处理,在每段末尾添加增强型奇偶校验码,译码器仅在译码搜索集内元素时进行路径分裂,其余元素直接执行硬判决译码,并在译码完一段序列后立即对该段进行校验,仅保留通过校验的路径,从而减少了错误路径对正确路径的竞争,使正确路径保留到译码结束的概率增加,改善了译码性能,同时减少了译码列表数,使得译码复杂度更低.仿真结果表明,与PSS-SS-SCL译码算法相比较,所提出算法能在一定程度上改善其性能增益且具有更低的译码复杂度.
Abstract
In order to improve the performance of the path splitting selecting strategy based on search set under the successive cancellation list (PSS-SS-SCL) decoding algorithm
an improved decoding algorithm based on the enhanced parity check code and Monte Carlo segment aiding successive cancellation list (EPC-MS-SCL) is proposed. The algorithm divides the information sequence into some segments in the encoding stage of the polar code
and adds an enhanced parity check code at the end of each segment. The decoder performs the path splitting only when decoding the elements within the search set (SS)
and directly does the hard decision for the other unfrozen bits. The decoder will verify the segment immediately after decoding a sequence
the verified path can only be retained. Thus the competition from the wrong paths to the correct path can be reduced to increase the probability of keeping the correct path until the end of the decoding and the performance of the decoding can be improved. Meanwhile
the decoding complexity is also reduced because of decreasing the number of the decoding lists. Simulation results show that compared with the PSS-SS-SCL decoding algorithm
the proposed decoding algorithm can improve the coding gain to a certain degree and reduce the decoding complexity too.
关键词
Keywords
references
ARIKAN E . Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels [J]. IEEE Transactions on Information Theory , 2009 , 55 ( 7 ): 3051 - 3073 .
LI X W , LI W B . A simplified successive cancellation list decoding algorithm for polar codes [J]. Journal of Chongqing University of Posts and Telecommunications (Natural Science Edition) , 2019 , 31 ( 4 ): 488 - 494 . (in Chinese)
LIU W , DUAN H G . Adaptive successive cancellation list bit-flip decoding of polar codes [J]. Journal of Chongqing University of Posts and Telecommunications(Natural Science Edition) , 2021 , 33 ( 1 ): 87 - 93 . (in Chinese)
TAL I , VARDY A . List decoding of polar codes [J]. IEEE Transactions on Information Theory , 2015 , 61 ( 5 ): 2213 - 2226 .
NIU K , CHEN K . CRC-aided decoding of polar codes [J]. IEEE Communications Letters , 2012 , 16 ( 10 ): 1668 - 1671 .
ZHOU H Y , ZHANG C , SONG W Q , et al . Segmented CRC-aided SC list polar decoding [C]// 2016 83rd Vehicular Technology Conference . Nanjing : IEEE , 2016 : 1 - 5 .
ZHOU H Y , LIANG X , LI L P , et al . Segmented successive cancellation list polar decoding with tailored CRC [J]. Journal of Signal Processing Systems , 2019 , 91 ( 8 ): 923 - 935 .
于永润 . 极化码编译码技术研究 [D]. 南京 : 东南大学 , 2019 .
YU Y R . Investigations on the Construction and Decoding of Polar Codes [D]. Nanjing : Southeast University , 2019 . (in Chinese)
GAO C , LIU R K , DAI B , et al . Path splitting selecting strategy-aided successive cancellation list algorithm for polar codes [J]. IEEE Communications Letters , 2019 , 23 ( 3 ): 422 - 425 .
BALATSOUKAS-STIMMING A , PARIZI M B , BURG A . LLR-based successive cancellation list decoding of polar codes [J]. IEEE Transactions on Signal Processing , 2015 , 63 ( 19 ): 5165 - 5179 .
ALAMDAR-YAZDI A , KSCHISCHANG F R . A simplified successive-cancellation decoder for polar codes [J]. IEEE Communications Letters , 2011 , 15 ( 12 ): 1378 - 1380 .
ZHANG Z Y , QIN K J , ZHANG L , et al . Progressive bit-flipping decoding of polar codes over layered critical sets [C]// 2017 IEEE Global Communications Conference . Singapore : IEEE , 2017 : 1 - 6 .
TRIFONOV P . Efficient design and decoding of polar codes [J]. IEEE Transactions on Communications , 2012 , 60 ( 11 ): 3221 - 3227 .