基于特殊节点划分的低时延极化码SCL译码器架构

韩国军 ,  曾子峰 ,  董鹏 ,  翟雄飞 ,  史治平

电子科技大学学报 ›› 2026, Vol. 55 ›› Issue (1) : 93 -99.

PDF (943KB)
电子科技大学学报 ›› 2026, Vol. 55 ›› Issue (1) : 93 -99. DOI: 10.12178/1001-0548.2024291
信息与通信工程

基于特殊节点划分的低时延极化码SCL译码器架构

作者信息 +

A low-latency architecture of SCL decoder for FPGA based on special node division

Author information +
文章历史 +
PDF (965K)

摘要

极化码基于信道极化理论提出,是唯一一种被理论证明可以达到香农限的信道编码方案。极化码主流的串行抵消列表(SCL)译码算法具有串行逐比特译码的特点,并且包含大量的路径度量和路径扩展,这导致译码时延较高。为了解决这一问题,提出了一种基于特殊节点划分的低时延SCL译码算法硬件架构,通过对不同类型的特殊节点分别使用剪枝或减分裂策略,以损失轻微译码性能为代价减少译码时延,提高吞吐量。为了提高译码器的灵活性,通过将不同码长码率的先验信息预先写入存储单元,从而实现编码参数可配置。可编程逻辑门阵列(FPGA)上的实验结果显示,在码长为128~1 024 bit以及码率为0.3~0.5的情况下,所提出的架构比标准SCL译码器降低了40.32%~56.87%的译码时延。

Abstract

Polar code proposed based on channel polarization is the only one that is proven to achieve the Shannon limit. The mainstream successive cancellation list (SCL) decoding algorithm shows the extremely high latency due to its massive path splitting and path metrics. To solve this problem, a low-latency SCL decoding hardware architecture based on special nodes is proposed in this paper. Pruning or split-reducing is considered for different nodes to reduce the decoding latency and improve the throughput with slight performance degradation. Moreover, to enhance the flexibility, the prior information of different code lengths and code rates is stored in the read-only memory (ROM) and is selected based on the input configuration. The implementation results of the proposed architecture on field programmable gate array (FPGA) show that the decoding cycles are reduced by 40.32%~56.87% compared with the standard SCL decoder with the code length varying from 128 to 1 024 bit and the code rate varying from 0.3 to 0.5.

关键词

极化码 / 串行抵消列表 / 低时延 / 可配置译码器 / 可编程逻辑门阵列

Key words

polar code / successive cancellation list / low latency / configurable decoder / FPGA

引用本文

引用格式 ▾
韩国军,曾子峰,董鹏,翟雄飞,史治平. 基于特殊节点划分的低时延极化码SCL译码器架构[J]. 电子科技大学学报, 2026, 55(1): 93-99 DOI:10.12178/1001-0548.2024291

登录浏览全文

4963

注册一个新账户 忘记密码

参考文献

[1]

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.

[2]

TAL I, VARDY A. List decoding of polar codes[J].IEEE Transactions on Information Theory, 2015, 61(5): 2213-2226.

[3]

NIU K, CHEN K. CRC—aided decoding of polar codes[J].IEEE Communications Letters, 2012, 16(10): 1668-1671.

[4]

太云飞. 极化码与CRC码的级联方法及其译码算法研究[D]. 成都: 电子科技大学,2023.

[5]

TAI Y F. Research on the cascading method of polar and CRC codes and the corresponding decoding algorithm[D]. Chengdu:University of Electronic Science and Technology of China, 2023.

[6]

ALAMDAR—YAZDI A, KSCHISCHANG F R. A simplified successive—cancellation decoder for polar codes[J].IEEE Communications Letters, 2011, 15(12): 1378-1380.

[7]

SARKIS G, GIARD P, VARDY A, et al. Fast polar decoders: Algorithm and implementation[J].IEEE Journal on Selected Areas in Communications, 2014, 32(5): 946-957.

[8]

SARKIS G, GIARD P, VARDY A, et al. Fast list decoders for polar codes[J].IEEE Journal on Selected Areas in Communications, 2015, 34(2): 318-328.

[9]

YUAN B, PARHI K K. LLR—based successive—cancellation list decoder for polar codes with multibit decision[J].IEEE Transactions on Circuits and Systems II: Express Briefs, 2016, 64(1): 21-25.

[10]

YUAN B, PARHI K K. Low—latency successive—cancellation list decoders for polar codes with multibit decision[J].IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2014, 23(10): 2268-2280.

[11]

LEROUX C, TAL I, VARDY A, et al. Hardware architectures for successive cancellation decoding of polar codes[C]//2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). Prague: IEEE, 2011: 1665-1668.

[12]

MISHRA A, RAYMOND A J, AMARU L G, et al. A successive cancellation decoder ASIC for a 1024—bit polar code in 180nm CMOS[C]//2012 IEEE Asian Solid State Circuits Conference (A—SSCC). Kobe: IEEE, 2012: 205-208.

[13]

HUANG Y, ZHANG Z, YOU X, et al. Efficient folded SC polar line decoder[C]//2018 IEEE 23rd International Conference on Digital Signal Processing (DSP). Shanghai: IEEE, 2018: 1-5.

[14]

YE L, ZHAI X, ZENG Z, et al. High—throughput polar code SCL decoding with dynamically configurable pipeline architecture[C]//2023 IEEE/CIC International Conference on Communications in China (ICCC). Dalian: IEEE,2023: 1-6.

[15]

AFISIADIS O, BALATSOUKAS—STIMMING A, BURG A. A low—complexity improved successive cancellation decoder for polar codes[C]//2014 48th Asilomar Conference on Signals, Systems and Computers. Pacific Grove: IEEE, 2014: 2116-2120.

[16]

FENG Z, NIU C, ZHANG Z, et al. List—serial pipelined hardware architecture for SCL decoding of polar codes[J].China Communications, 2023, 20(3): 175-184.

[17]

LIANG X, WANG H, SHEN Y, et al. Efficient stochastic successive cancellation list decoder for polar codes[J].Science China Information Sciences, 2020, 63: 1-19.

[18]

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.

基金资助

国家自然科学基金(62301166)

国家自然科学基金(62471151)

国家自然科学基金(62371101)

AI Summary AI Mindmap
PDF (943KB)

288

访问

0

被引

详细

导航
相关文章

AI思维导图

/