Efficient stochastic successive cancellation list decoder for polar codes

被引：0

作者：

Xiao LIANG ^{[1
,2
,3
,4
]}

Huizheng WANG ^{[1
,2
,3
,4
]}

Yifei SHEN ^{[1
,2
,3
,4
]}

Zaichen ZHANG ^{[1
,2
,3
,4
]}

Xiaohu YOU ^{[1
,2
,3
,4
]}

Chuan ZHANG ^{[1
,2
,3
,4
]}

机构：

[1] Laboratory of Efficient Architectures for Digital-communication and Signal-processing (LEADS),Southeast University

[2] National Mobile Communications Research Laboratory,Southeast University

[3] Quantum Information Center of Southeast University

[4] Purple Mountain Laboratories

来源：

Science China(Information Sciences) | 2020年 / 63卷 / 10期

基金：

中国国家自然科学基金; 国家重点研发计划;

关键词：

D O I：

暂无

中图分类号：

TN911.22 [信道编码理论];

学科分类号：

070104 ; 081101 ;

摘要：

Polar codes are one of the most favorable capacity-achieving codes owing to their simple structures and low decoding complexity. Successive cancellation list（SCL） decoders with large list sizes achieve performances very close to those of maximum-likelihood（ML） decoders. However, hardware cost is a severe problem because an SCL decoder with list size L consists of L copies of a successive cancellation（SC）decoder. To address this issue, a stochastic SCL（SSCL） polar decoder is proposed. Although stochastic computing can achieve a good hardware reduction compared with the deterministic one, its straightforward application to an SCL decoder is not well-suited owing to the precision loss and severe latency. Therefore,a doubling probability approach and adaptive distributed sorting（DS） are introduced. A corresponding hardware architecture is also developed. Field programmable gate array（FPGA） results demonstrate that the proposed stochastic SCL polar decoder can achieve a good performance and complexity tradeoff.

引用

页码：133 / 151

页数：19