Latest revision as of 18:24, 3 February 2021

Abstract

Polar codes attract more and more attention of researchers in recent years, since its capacity achieving property. However, their error-correction performance under successive cancellation (SC) decoding is inferior to other modern channel codes at short or moderate blocklengths. SC-Flip (SCF) decoding algorithm shows higher performance than SC decoding by identifying possibly erroneous decisions made in initial SC decoding and flipping them in the sequential decoding attempts. However, it performs not well when there are more than one erroneous decisions in a codeword. In this paper, we propose a path metric aided bit-flipping decoding algorithm to identify and correct more errors efficiently. In this algorithm, the bit-flipping list is generated based on both log likelihood ratio (LLR) based path metric and bit-flipping metric. The path metric is used to verify the effectiveness of bit-flipping. In order to reduce the decoding latency and computational complexity, its corresponding pipeline architecture is designed. By applying these decoding algorithms and pipeline architecture, an improvement on error-correction performance can be got up to 0.25dB compared with SCF decoding at the frame error rate of $10^{-4}$, with low average decoding latency.

Comment: 6 pages, 6 figures, IEEE Wireless Communications and Networking Conference (2019 WCNC)

Original document

The different versions of the original document can be found in:

• http://arxiv.org/abs/1903.03381

• http://arxiv.org/pdf/1903.03381

• http://xplorestaging.ieee.org/ielx7/8870904/8885408/08885419.pdf?arnumber=8885419,

http://dx.doi.org/10.1109/wcnc.2019.8885419

• https://dblp.uni-trier.de/db/conf/wcnc/wcnc2019.html#0068CW0X19,

https://academic.microsoft.com/#/detail/2982365927