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

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 ga...

Full description

Saved in:
Bibliographic Details
Published in2019 IEEE Information Theory Workshop (ITW) pp. 1 - 5
Main Authors Ebada, Moustafa, Elkelesh, Ahmed, Brink, Stephan ten
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.08.2019
Subjects
5G mobile communication
Complexity theory
Iterative decoding
Maximum likelihood decoding
Polar codes
Online AccessGet full text

Cover

More Information
Summary: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 Arıkan'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.
DOI:10.1109/ITW44776.2019.8989269