Belief Propagation List Ordered Statistics Decoding of Polar Codes
Guy Mogilevsky, David Burshtein

TL;DR
This paper introduces a novel decoding method combining belief propagation list decoding with ordered statistics decoding for polar codes, significantly enhancing performance with manageable complexity.
Contribution
It proposes a new decoding scheme that integrates OSD with CBPL for polar codes, including partial reprocessing to balance performance and complexity.
Findings
Significant performance improvement over standard CBPL decoding.
Partial reprocessing offers a favorable trade-off between complexity and decoding accuracy.
Effective decoding strategy for polar codes with adaptable complexity.
Abstract
It is shown how to combine ordered statistics decoding (OSD) with CRC-aided belief propagation list (CBPL) decoding of polar codes. Even when the reprocessing order of the OSD is as low as one, the new decoder is shown to significantly improve on CBPL. For reprocessing orders higher than one, we suggest partial reprocessing, where only error patterns associated with the least reliable part of the belief propagation decoded most reliable independent bits are considered. This type of partial reprocessing offers a trade-off between performance and computational complexity.
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.
Taxonomy
TopicsError Correcting Code Techniques · DNA and Biological Computing · Advanced Wireless Communication Techniques
