期刊
ELECTRONICS
卷 11, 期 15, 页码 -出版社
MDPI
DOI: 10.3390/electronics11152458
关键词
polar codes; belief propagation list; belief propagation flip; permuted factor graph; path extension; path pruning
资金
- National Key R&D Program of China [2020YFB1807203]
- Ericsson
- National Natural Science Foundation of China [61871032]
This paper proposes an improved decoding algorithm for polar codes, which achieves comparable bit error ratio performance to the successive cancellation list decoding scheme while maintaining low decoding latency and high parallelism.
Polar codes have become the channel coding scheme for control channel of enhanced mobile broadband in the 5G communication systems. Belief propagation (BP) decoding of polar codes has advantages of low decoding latency and high parallelism but achieves worse bit error ratio (BER) performance compared with the successive cancellation list (SCL) decoding scheme. In this paper, an improved BP list (IBPL) decoding algorithm is proposed with comparable BER performance to SCL algoritm. Firstly, the optimal permuted factor graph is analyzed for polar codes, which improves the performance of the BP decoder without path extension. Furthermore, based on the optimal graph, the bit metric and decoding path metric are proposed to extend and prune the decoding path. The proposed IBPL decoder is focused on not only the permutation of polar codes but also the reliabilities of decoded codewords during each iteration of BP decoding, which has a more accurate decoding path list. The simulation results show that the proposed IBPL decoder improves the BER performance compared with the original BP decoder significantly, and can approach the performance of the SCL decoder at low signal to noise ratio regions.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据