AI 中文总结
研究2×2内核非二进制极化码低复杂度译码问题，提出SR-NBSCL、ESR-NBSCL和ABP-NBSCL译码算法，通过跳过路径分裂、利用特殊结构及引入ARD度量等措施降低复杂度，仿真表明算法能在低复杂度下实现接近传统译码的FER性能。
AI 中文摘要
非二进制连续消除列表（NB-SCL）译码在每个信息符号处将每个幸存路径扩展为q个候选分支，导致高路径扩展、排序和剪枝复杂度。为解决此问题，本文提出2×2内核非二进制极化码（NBPC）的低复杂度列表译码算法。首先设计了分裂简化非二进制连续消除列表（SR-NBSCL）译码器，在当前符号足够可靠时跳过路径分裂。接着利用最终速率为1的节点结构，将最后一组信息符号切换为简化非二进制连续消除（NB-SC）译码，得到增强分裂简化非二进制连续消除列表（ESR-NBSCL）译码器。为进一步减少不可靠符号处的分支扩展，引入累积可靠性偏差（ARD）度量，提出自适应分支剪枝非二进制连续消除列表（ABP-NBSCL）译码器，在排序前修剪不可靠候选分支，降低主要的排序复杂度。仿真结果表明，所提译码器能以低得多的复杂度实现接近传统NB-SCL译码的误帧率（FER）性能。特别是，ABP-NBSCL译码器在几个测试信噪比（SNR）下将路径分裂数（PSN）减少80%以上，性能损失可忽略不计。
英文摘要
Non-binary successive cancellation list (NB-SCL) decoding expands each surviving path into $q$ candidate branches at every information symbol, which causes high path expansion, sorting, and pruning complexity. To address this issue, this paper proposes low-complexity list decoding algorithms for $2\times2$ kernel non-binary polar codes (NBPCs). First, we design a split-reduced non-binary successive cancellation list (SR-NBSCL) decoder that skips path splitting when the current symbol is sufficiently reliable. We then exploit the final Rate-1 node structure and switch the last group of information symbols to simplified non-binary successive cancellation (NB-SC) decoding, resulting in the enhanced split-reduced non-binary successive cancellation list (ESR-NBSCL) decoder. To further reduce branch expansion at unreliable symbols, we introduce an accumulated reliability-deviation (ARD) metric and propose an adaptive branch-pruning non-binary successive cancellation list (ABP-NBSCL) decoder, which prunes unreliable candidate branches before sorting and then reduces the dominant sorting complexity. Simulation results show that the proposed decoders achieve frame-error-rate (FER) performance close to that of conventional NB-SCL decoding with much lower complexity. In particular, the ABP-NBSCL decoder reduces the path splitting number (PSN) by more than $80\%$ at several tested signal-to-noise ratios (SNRs), with a negligible performance loss.
