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

Xiaojun ZHANG; Na LI; Yanfei DONG; Jianming CUI; Hua GUO

doi:10.11999/JEIT200355

Volume 43 Issue 1

Jan. 2021

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2021 > 43(1): 77-84

Xiaojun ZHANG, Na LI, Yanfei DONG, Jianming CUI, Hua GUO. Low-complexity Early Stopping Criterion for Belief Propagation Decoding of Polar Codes[J]. Journal of Electronics & Information Technology, 2021, 43(1): 77-84. doi: 10.11999/JEIT200355

Citation:

Xiaojun ZHANG, Na LI, Yanfei DONG, Jianming CUI, Hua GUO. Low-complexity Early Stopping Criterion for Belief Propagation Decoding of Polar Codes[J]. Journal of Electronics & Information Technology, 2021, 43(1): 77-84. doi: 10.11999/JEIT200355

Citation:

PDF( 2803 KB)

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

doi: 10.11999/JEIT200355

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

Received Date: 2020-05-08
Rev Recd Date: 2020-10-01

Available Online: 2020-10-13

Publish Date: 2021-01-15

Abstract

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.
- Polar code,
- Belief propagation,
- Early stopping criterion,
- Low-complexity,
- Codeword estimate

FullText(HTML)

References(16)

References

https://www.oulu.fi/university/news/6g-white-paper, 2019.

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–3071. doi: 10.1109/TIT.2009.2021379

刘建航, 何怡静, 李世宝, 等. 基于预译码的极化码最大似然简化连续消除译码算法[J]. 电子与信息学报, 2019, 41(4): 959–966. doi: 10.11999/JEIT180324

LIU Jianhang, HE Jingyi, LI Shibao, et al. Pre-decoding based maximum-likelihood simplified successive-cancellation decoding of polar codes[J]. Journal of Electronics &Information Technology, 2019, 41(4): 959–966. doi: 10.11999/JEIT180324

郭锐, 王美洁, 王杰. 基于缩短极化码的MLC NAND Flash差错控制技术研究[J]. 电子与信息学报, 2017, 39(7): 1658–1665. doi: 10.11999/JEIT160864

GUO Rui, WANG Meijie, and WANG Jie. Research on the MLC Nand flash error control technology based on polar codes[J]. Journal of Electronics &Information Technology, 2017, 39(7): 1658–1665. doi: 10.11999/JEIT160864

LAY K T and CHANG C H. Enhanced successive cancellation for decoding of polar codes with very low latency through multiple parity checks[C]. The 4th International Conference on Intelligent Green Building and Smart Grid, Yichang, China, 2019: 366–370. doi: 10.1109/IGBSG.2019.8886186.

YUAN Bo and PARHI K K. Early stopping criteria for energy-efficient low-latency belief-propagation polar code decoders[J]. IEEE Transactions on Signal Processing, 2014, 62(24): 6496–6506. doi: 10.1109/tsp.2014.2366712

YAN Yongli, ZHANG Xuanxuan, and WU Bin. Simplified early stopping criterion for belief-propagation polar code decoder based on frozen bits[J]. IEEE Access, 2019, 7: 134691–134696. doi: 10.1109/ACCESS.2019.2940135

CHOI S and YOO H. Area-efficient early-termination technique for belief-propagation polar decoders[J]. Electronics, 2019, 8(9): 1001. doi: 10.3390/electronics8091001

REN Yuanrui, ZHANG Chuan, LIU Xing, et al. Efficient early termination schemes for belief-propagation decoding of polar codes[C]. The 11th IEEE International Conference on ASIC, Chengdu, China, 2015: 1–4. doi: 10.1109/ASICON.2015.7517046.

SIMSEK C and TURK K. Simplified early stopping criterion for belief-propagation polar code decoders[J]. IEEE Communications Letters, 2016, 20(8): 1515–1518. doi: 10.1109/LCOMM.2016.2580514

SIMSEK C and TURK K. Hardware optimization for belief propagation polar code decoder with early stopping criteria using high-speed parallel-prefix ling adder[C]. The 40th International Conference on Telecommunications and Signal Processing, Barcelona, Spain, 2017: 182–185. doi: 10.1109/TSP.2017.8075964.

ALBAYRAK C, SIMSEK C, and TURK K. Low-complexity early termination method for rateless soft decoder[J]. IEEE Communications Letters, 2017, 21(11): 2356–2359. doi: 10.1109/LCOMM.2017.2740207

ZHANG Qingshuang, LIU Aijun, and TONG Xinhai. Early stopping criterion for belief propagation polar decoder based on frozen bits[J]. Electronics Letters, 2017, 53(24): 1576–1578. doi: 10.1049/el.2017.3316

GIARD P, BALATSOUKAS-STIMMING A, and BURG A. On the tradeoff between accuracy and complexity in blind detection of polar codes[C]. The 10th IEEE International Symposium on Turbo Codes & Iterative Information Processing, Hongkong, China, 2018: 1–5. doi: 10.1109/ISTC.2018.8625366.

CHUNG S Y, RICHARDSON T J, and URBANKE R L. Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation[J]. IEEE Transactions on Information Theory, 2001, 47(2): 657–670. doi: 10.1109/18.910580

梁昌洪, 李龙, 史小卫. 标准正态分布的简洁闭式[J]. 西安电子科技大学学报: 自然科学版, 2003, 30(3): 289–292. doi: 10.3969/j.issn.1001-2400.2003.03.001

LIANG Changhong, LI Long, and SHI Xiaowei. A compact closed form of standard normal distribution[J]. Journal of Xidian University, 2003, 30(3): 289–292. doi: 10.3969/j.issn.1001-2400.2003.03.001

Relative Articles

Supplements(0)

Cited By

Proportional views