张小军^{1, 2,,},
李娜¹,
董雁飞¹,
崔建明¹,
郭华¹
1.山东科技大学电子信息工程学院 青岛 266590
2.高效能服务器和存储技术国家重点实验室 济南 250101
基金项目:山东省自然科学基金联合基金(ZR2019LZH001)，山东省重点研发计划(2019GGX101066)，山东省高等学校青创科技计划(2019KJN020, 2019KJN024)，泰山****计划

详细信息

作者简介:张小军：男，1980年生，副教授，研究方向为信道编译码
李娜：女，1996年生，硕士生，研究方向为极化码译码
董雁飞：男，1991年生，博士生，研究方向为极化码译码
崔建明：男，1969年生，副教授，研究方向为信道编译码
郭华：男，1977年生，讲师，研究方向为电路设计

通讯作者:张小军　zhangxiaojun@sdust.edu.cn

中图分类号:TN911.22

计量

文章访问数:601
HTML全文浏览量:195
PDF下载量:47
被引次数:0

出版历程

收稿日期:2020-05-08
修回日期:2020-10-01
网络出版日期:2020-10-13
刊出日期:2021-01-15

Low-complexity Early Stopping Criterion for Belief Propagation Decoding of Polar Codes

Xiaojun ZHANG^{1, 2,,},
Na LI¹,
Yanfei DONG¹,
Jianming CUI¹,
Hua GUO¹
1. College of Electronic and Information Engineering, Shandong University of Science and Technology, Qingdao 266590, China
2. State Key Laboratory of High-end Server and Storage Technology, Jinan 250101, China
Funds:The Joint Fund of Natural Science Foundation of Shandong Province (ZR2019LZH001), The Shandong Key Research and Development Project (2019GGX101066), The Excellent Youth Innovation Team of Shandong Province Higher Education (2019KJN020, 2019KJN024), The Taishan Scholar Program of Shandong Province


摘要
摘要:针对极化码译码延迟较高的问题, 该文提出了一种针对置信度传播算法的早期停止准则，通过监测码字估值$\hat x$的收敛性来终止译码。该准则利用高斯近似分析选取码字中Q个出错概率较小的比特构成比较空间，由于比较的位数较少，且仅采用异或和或运算，其计算复杂度较低。与基于信息序列估值$\hat u$的方案不同，提出的准则在计算$\hat u$之前已完成检测，不会导致额外的译码延迟。仿真和FPGA综合结果表明: 该准则相对于G-Matrix, 最坏信息位(WIB)和冻结位误码率(FBER)可有效节省硬件资源；当最大迭代次数设置为40次时，相比于G-Matrix准则，复杂度下降的代价是平均迭代次数在3.5 dB处上升了29.98%，相比于WIB和FBER方案，平均迭代次数分别减少39.44%和27.67%。
关键词:极化码/
置信度传播/
早期停止准则/
低复杂度/
码字估值
Abstract:Considering the high decoding latency of polar code, an early stopping criterion for belief propagation is presented, which terminates the decoding by monitoring the convergence of codeword estimate $\hat x$. In this paper, Gaussian approximation is used to analyze and select Q bit with low error probability to construct the comparison space. Because the number of bit to be compared is small and only XOR and OR operation is used, the computational complexity is low. Different from other criteria based on $\hat u$, the proposed criterion does not lead to additional latency for it has been completed before calculating $\hat u$. Simulation and FPGA Synthesis results show that compared with G-matrix, Worst Information Bit (WIB) and Frozen Bit Error Rate (FBER), this criterion can effectively save hardware resource.When the maximum iteration number is set to 40, compared with the G-matrix criterion, the average iteration time is increased by 29.98% at 3.5 dB, and the average iteration times are reduced by 39.44% and 27.67% respectively compared with the WIB and FBER schemes.
Key words:Polar code/
Belief propagation/
Early stopping criterion/
Low-complexity/
Codeword estimate



PDF全文下载地址:

https://jeit.ac.cn/article/exportPdf?id=b1bf8e45-cefd-4b4f-b10a-6578ed51289d