Belief Propagation List Decoding of Polar Codes

• Published in: IEEE communications letters Vol. 22; no. 8; pp. 1536 - 1539
• Main Authors: Elkelesh, Ahmed, Ebada, Moustafa, Cammerer, Sebastian, ten Brink, Stephan
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.08.2018; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Belief propagation; belief propagation decoding; Codes; Complexity theory; Decoders; Decoding; Encoding; Euclidean geometry; Iterative decoding; Iterative methods; list decoding; Maximum likelihood decoding; Performance enhancement; permuted factor graphs; Polar codes; Power line communications; Propagation; RM-Polar codes; successive cancellation list decoding
• ISSN: 1089-7798; 1558-2558
• DOI: 10.1109/LCOMM.2018.2850772

We propose a belief propagation list (BPL) decoder with comparable performance to the successive cancellation list (SCL) decoder of polar codes, which already achieves the maximum likelihood (ML) bound of polar codes for sufficiently large list size L. The proposed decoder is composed of multiple parallel independent belief propagation (BP) decoders based on differently permuted polar code factor graphs. A list of possible transmitted codewords is generated and the one closest to the received vector, in terms of Euclidean distance, is picked. To the best of our knowledge, the proposed BPL decoder provides the best performance of plain polar codes under iterative decoding known so far. The proposed algorithm does not require any changes in the polar code structure itself, rendering the BPL into an alternative to the SCL decoder, equipped with a soft output capability enabling, e.g., iterative detection and decoding to further improve performance. Further benefits are the lower decoding latency than the SCL decoder and the possibility of high throughput implementations. Additionally, we show that a different selection strategy of frozen bit positions can further enhance the error-rate performance of the proposed decoder.