On the Decoding of Polar Codes on Permuted Factor Graphs
Nghia Doan, Seyyed Ali Hashemi, Marco Mondelli, Warren J. Gross

TL;DR
This paper proposes a method to improve polar code decoding by using a single decoder for multiple permutations, resulting in better error correction performance suitable for 5G applications.
Contribution
It introduces a way to map factor graph permutations to codeword permutations, enabling a unified decoder and a set of predetermined permutations for enhanced error correction.
Findings
Error-correction performance improved by over 0.25 dB at FER of 10^{-4}
Single decoder can handle multiple permutations effectively
Predetermined permutations enhance decoding success
Abstract
Polar codes are a channel coding scheme for the next generation of wireless communications standard (5G). The belief propagation (BP) decoder allows for parallel decoding of polar codes, making it suitable for high throughput applications. However, the error-correction performance of polar codes under BP decoding is far from the requirements of 5G. It has been shown that the error-correction performance of BP can be improved if the decoding is performed on multiple permuted factor graphs of polar codes. However, a different BP decoding scheduling is required for each factor graph permutation which results in the design of a different decoder for each permutation. Moreover, the selection of the different factor graph permutations is at random, which prevents the decoder to achieve a desirable error-correction performance with a small number of permutations. In this paper, we first show…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
