合肥工业大学 微电子设计研究所 教育部IC网上合作研究中心,安徽,合肥,230601
纸质出版:2021
移动端阅览
林青, 杜高明, 戴吴骏, 王晓蕾. 一种高性能极化码Fast-SSC译码器设计[J]. 微电子学与计算机, 2021, 38(2): 7-13, 18.
LIN Qing, DU Gao-ming, DAI Wu-jun, et al. Design of a high-performance fast-SSC decoder for polar codes[J]. 2021, 38(2): 7-13.
为了进一步降低无线通信系统中信道编码极化码Fast-SSC译码器的译码延迟和硬件资源消耗,本文提出了两种对Fast-SSC译码算法的优化方法,基于FPGA硬件实现了码长=1 024优化的Fast-SSC译码器.基于Fast-SSC译码树上的四种特殊结点Rate0、Rate1、Rep和SPC,提出分别以Rate0结点和Rep结点为基础进行组合型特殊结点的拓展,使译码树上的特殊结点类型由原来的四种增加至十种以上,进一步加快了搜索译码树的速度;提出存储器资源复用的方法,相同译码树深度的结点使用相同的存储空间.综合结果表明最大工作频率为169 MHz,译码延迟为1.71 μs,数据吞吐率为599 Mbps,存储器消耗为14.8 Kbit,有效提升了Fast-SSC译码器的整体性能.
In order to further reduce the decoding delay and hardware resource consumption of the Fast-SSC decoder of channel-coded polarized code in wireless communication system
this paper proposes two optimization methods for the Fast-SSC decoding algorithms
and realizes the fast-SSC decoder optimized with code length =1 024 based on FPGA hardware. Based on the four special nodes Rate0
Rate1
Rep
and SPC in the fast-SSC decoding tree
the expansion of combined special nodes based on the Rate0 node and the Rep node respectively is proposed
which makes the special nodes in the decoder tree increase from the original four to more than ten
further speeding up the speed of searching decoder tree. A method of multiplexing memory resources is proposed in which nodes with the same decoding tree depth use the same storage space. The comprehensive results show that the maximum operating frequency is 169 MHz
the decoding delay is 1.71 μs
the data throughput is 599 Mbps
and the memory consumes 14.8 Kbit
which effectively improves the overall performance of the Fast-SSC decoder.
GIARD P, SARKIS G, THIBEAULT C, et al. A 638 Mbps low-complexity rate 1/2 polar decoder on FPGAs[C]//Proceedings of 2015 IEEE Workshop on Signal Processing Systems (SiPS). Hangzhou: IEEE, 2015: 1-6. DOI: 10.1109/SiPS.2015.7345007.
ARIKAN E.Channel polarization: a method for constructing capacity-achieving codes for symmetric binary-input memoryless channels[J]. IEEE Transactions onInformation Theory, 2009, 55(7): 3051-3073. DOI:10.1109/TIT.2009.2021379.
DIZDAR O, ARIKAN E. Ahigh-throughput energy-efficient implementation of successive cancellation decoder for polar codes using combinational logic[J]. IEEE Transactions on Circuits and Systems Ⅰ: Regular Papers, 2016, 63(3): 436-447. DOI:10.1109/TCSI.2016.2525020.
GIARD P, BALATSOUKAS-STIMMING A, SARKIS G, et al.Fast Low-complexity decoders for low-rate polar codes[J]. Journal of Signal Processing Systems, 2018, 90(5): 675-685. DOI:10.1007/s11265-016-1173-y.
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. DOI:10.1109/JSAC.2014.140514.
ALAMDAR-YAZDI A, KSCHISCHANG F R. A simplified successive-cancellation decoder for polar codes[J]. IEEE Communications Letters, 2011, 15(12): 1378-1380. DOI:10.1109/LCOMM.2011.101811.111480.
ERCAN F, CONDO C, GROSS W J. Reduced-memory high-throughput fast-SSC polar code decoder architecture[C]//Proceedings of 2017 IEEE International Workshop on Signal Processing Systems (SiPS). Lorient: IEEE, 2017: 1-6. DOI: 10.1109/SiPS.2017.8110014.
ZENG J, ZHOU Y C, LIN J, et al. Hardware implementation of improved fast-SSC-flip decoder for polar codes[C]//Proceedings of2019 IEEE Computer Society AnnualSymposium on VLSI (ISVLSI). Miami, FL, USA: IEEE, 2019. DOI: 10.1109/ISVLSI.2019.00109.
LEROUX C, TAL I, VARDY A, et al. Hardware architectures for successive cancellation decoding of polar codes[C]//Proceedings of 2011IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). Prague: IEEE, 2011: 1665-1668. DOI: 10.1109/ICASSP.2011.5946819.
ZHANG C, PARHI K K. Latency analysis and architecture design of simplified SC polar decoders[J]. IEEE Transactions on Circuits % Systems IIExpressBriefs, 2014, 61(2): 115-119.DOI:10.1109/TCSII.2013.2291065.
EGILMEZ K Z B, XIANG L P, MAUNDER R G, et al. The development, operation and performance of the 5G polar codes[J]. IEEE Communications Surveys % Tutorials, 2020, 22(1): 96-122. DOI:10.1109/COMST.2019.2 960746.
0
浏览量
41
下载量
0
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010602201714号