Polar Code Construction for List Decoding
Peihong Yuan, Tobias Prinz, Georg B\"ocherer, Onurcan \.I\c{s}can,, Ronald B\"ohnke, Wen Xu
TL;DR
This paper proposes new polar code constructions optimized for list decoding, balancing performance and complexity, and demonstrates their superiority over existing codes through simulations.
Contribution
It introduces a heuristic polar code construction for SCL decoding and a novel LWB-based construction with constraints among low weight bits.
Findings
LWB-polar codes outperform CRC-polar codes under SCL decoding
The proposed constructions achieve better FER performance
Simulation results validate the effectiveness of the new methods
Abstract
A heuristic construction of polar codes for successive cancellation list (SCL) decoding with a given list size is proposed to balance the trade-off between performance measured in frame error rate (FER) and decoding complexity. Furthermore, a construction based on dynamically frozen bits with constraints among the "low weight bits" (LWB) is presented. Simulation results show that the LWB-polar codes outperform the CRC-polar codes and the eBCH-polar codes under SCL decoding.
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 · Advanced Wireless Communication Techniques · DNA and Biological Computing