Papers
Topics
Authors
Recent
Search
2000 character limit reached

Study of Polarization-Driven Shortening for Polar Codes Designed with the Gaussian Approximation

Published 1 Aug 2018 in cs.IT and math.IT | (1808.00143v1)

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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.