Polar codes is the only coding scheme in the world that has been proved that the Shannon threshold is reachable. Because of the high time delay caused by the serial characteristic of Successive Cancellation (SC) decoding, the Belief Propagation (BP) decoding has received more attention because of its higher throughput. However, because its decoding performance is not as good as SC decoding, Bit-Flip (BF) decoding is used in BP. Aiming at the inaccurate construction of flip set in current bit flipping decoding, this paper proposes a new bit error rate BP BF (BPF) decoding algorithm, which is used to construct flip set. We also propose rough flip set and fine flip set Concept of flip set. The rough flip set is constructed by the variance of the characteristics of data stability. The range of the flip set is reduced by the difference in bit error rate, that is, the fine flip set. The research results show that the algorithm proposed in this paper is superior to the current best decoding algorithms such as BP, Enhanced BPF (EBPF) and Log Likelihood Ratio BPF (BPF-LLR). At the same time, the number of iterations of the algorithm is significantly reduced compared with other bit-flipping decoding algorithms.
Full Text Finder