Abstract
Recently, belief propagation list (BPL) decoding has been proposed to achieve the excellent parallel decoding performance of polar codes with high throughput and low latency. However, the performance gap between BPL decoding and state-of-the-art successive cancellation list (SCL) decoding is still significant at practical SNRs. In this letter, we propose an efficient BPL flip (EBPLF) decoding algorithm for filling this gap. Firstly, an efficient bit-flipping strategy under BPL decoding is proposed to allow multiple bits being flipped more efficiently than the existing bit-flipping strategy. Then, by exploiting the decoding diversity and reliability of each bit over the multiple factor graphs within BPL decoding, an enhanced flip set is constructed to identify the error-prone patterns in an efficient way. Extensive simulation results show that EBPLF decoding outperforms the existing BPLF scheme and approaches the performance of adaptive SCL decoding at practical SNRs with much lower average latency.
Funding Information
  • National Natural Science Foundation of China (Grants U21A20450)

This publication has 16 references indexed in Scilit: