Papers
Topics
Authors
Recent
Search
2000 character limit reached

Optimizing Polar Codes Compatible with Off-the-Shelf LDPC Decoders

Published 26 Sep 2019 in cs.IT and math.IT | (1909.12030v1)

Abstract: Previous work showed that polar codes can be decoded using off-the-shelf LDPC decoders by imposing special constraints on the LDPC code structure, which, however, resulted in some performance degradation. In this paper we show that this loss can be mitigated; in particular, we demonstrate how the gap between LDPC-style decoding and Arikan's Belief Propagation (BP) decoding of polar codes can be closed by taking into account the underlying graph structure of the LDPC decoder while jointly designing the polar code and the parity-check matrix of the corresponding LDPC-like code. The resulting polar codes under conventional LDPC-style decoding are shown to have similar error-rate performance when compared to some well-known and standardized LDPC codes. Moreover, we obtain performance gains in the high SNR region.

Citations (3)

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.