基于改进第一关键集的极化码SCLF译码算法
SCLF Decoding Algorithm of Polar Codes Based on the Improved First Critical Set
袁建国 1贺京杰 1张丰果 1黄胜1
作者信息
- 1. 重庆邮电大学 通信与信息工程学院, 重庆400065
- 折叠
摘要
为了改进极化码串行抵消列表比特翻转(SCLF)译码算法的误码性能,通过分析已完成译码的比特对未译码比特的影响,提出了一种优化SCLF译码算法的算法,改进了关键集精度.以第一关键集(FCS)作为初始关键集,通过计算比特不可靠度的理论值与实际值,筛选出FCS中包含串行抵消状态路径的错误比特,并按信道可靠度升序排列形成改进第一关键集(IFCS).用IFCS能有效提高翻转准确性并减少重译码次数.仿真结果表明,所提算法相较于基于修正关键集的SCLF译码算法和决策后处理SCLF译码算法具有更好的误码性能和更低的复杂度,同时还可以与小列表循环冗余校验辅助SCL(CA-SCL)译码算法结合,达到大列表CA-SCL译码算法的性能水平.
Abstract
In order to enhance the error performance of the successive cancellation list bit-flip ( SCLF) decoding algorithm for polar codes, a method has been proposed to optimize the SCLF decoding algorithm by refining the accuracy of the critical sets.This approach involves analyzing the impact of decoded bits on undecoded bits, namely, devising strategies to improve the precision of the critical set.It takes the first critical set ( FCS ) as the initial critical set, selects the error bits containing the successive cancellation state path in the FCS by calculating the theoretical value and the actual value of the bit unreliability, and arranges them in the ascending order of the channel reliability to construct the improved first critical set ( IFCS) .The IFCS can effectively improve the flipping accuracy and reduce the number of redecoding.Simulation results show that the proposed algorithm has better bit error performance and lower complexity than the SCLF based on the revised critical set and the SCLF based on the decision post-processing decoding algorithms, and it can be combined with cyclic redundancy check aided successive cancellation list algorithm of small list size to achieve the similar decoding performance of large list size.
关键词
极化码/第一关键集/串行抵消列表/比特翻转Key words
polar codes/first critical set/successive cancellation list/bit-flip引用本文复制引用
基金项目
国家自然科学基金(61971079)
重庆市研究生科研创新项目(CYS21301)
出版年
2024
NETL
NSTL
万方数据