Study of Polarization-Driven Shortening for Polar Codes Designed with the Gaussian Approximation
R. M. Oliveira, R. C. de Lamare

TL;DR
This paper introduces a polarization-driven shortening method for polar codes that improves performance by aligning generator matrix reduction with channel polarization, verified through simulations.
Contribution
The paper proposes a novel PD shortening technique that relates generator matrix rows to polarization indices, enhancing rate-compatible polar code design.
Findings
PD shortening outperforms existing methods in simulations
The technique effectively reduces generator matrix size while maintaining performance
Performance analyzed using Spectrum Distance (SD) measure
Abstract
This paper presents a polarization-driven (PD) shortening technique for the design of rate-compatible polar codes. The proposed shortening strategy consists of reducing the generator matrix by relating its row index with the channel polarization index. We assume that the shortened bits are known by both the encoder and the decoder and employ successive cancellation (SC) for decoding the shortened codes constructed by the proposed PD technique. A performance analysis is then carried out based on the Spectrum Distance (SD). Simulations show that the proposed PD-based shortened polar codes outperform existing shortened polar codes.
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 · Satellite Communication Systems
