Permutation decoding gained recent interest as it can exploit the symmetries
of a code in a parallel fashion. Moreover, it has been shown that by viewing
permuted polar codes as polar subcodes, the set of usable permutations in
permutation decoding can be increased. We extend this idea to pre-transformed
polar codes, such as cyclic redundancy check (CRC)-aided polar codes, which
previously could not be decoded using permutations due to their lack of
automorphisms. Using belief propagation (BP)-based subdecoders, we showcase a
performance close to CRC-aided SCL (CA-SCL) decoding. The proposed algorithm
outperforms the previously best performing iterative CRC-aided belief
propagation list (CA-BPL) decoder both in error-rate performance and decoding
latency.
Description
[2205.06631] A Polar Subcode Approach to Belief Propagation List Decoding
%0 Journal Article
%1 geiselhart2022polar
%A Geiselhart, Marvin
%A Elkelesh, Ahmed
%A Clausius, Jannis
%A Brink, Stephan ten
%D 2022
%K myown from:mgeiselhart
%T A Polar Subcode Approach to Belief Propagation List Decoding
%U http://arxiv.org/abs/2205.06631
%X Permutation decoding gained recent interest as it can exploit the symmetries
of a code in a parallel fashion. Moreover, it has been shown that by viewing
permuted polar codes as polar subcodes, the set of usable permutations in
permutation decoding can be increased. We extend this idea to pre-transformed
polar codes, such as cyclic redundancy check (CRC)-aided polar codes, which
previously could not be decoded using permutations due to their lack of
automorphisms. Using belief propagation (BP)-based subdecoders, we showcase a
performance close to CRC-aided SCL (CA-SCL) decoding. The proposed algorithm
outperforms the previously best performing iterative CRC-aided belief
propagation list (CA-BPL) decoder both in error-rate performance and decoding
latency.
@article{geiselhart2022polar,
abstract = {Permutation decoding gained recent interest as it can exploit the symmetries
of a code in a parallel fashion. Moreover, it has been shown that by viewing
permuted polar codes as polar subcodes, the set of usable permutations in
permutation decoding can be increased. We extend this idea to pre-transformed
polar codes, such as cyclic redundancy check (CRC)-aided polar codes, which
previously could not be decoded using permutations due to their lack of
automorphisms. Using belief propagation (BP)-based subdecoders, we showcase a
performance close to CRC-aided SCL (CA-SCL) decoding. The proposed algorithm
outperforms the previously best performing iterative CRC-aided belief
propagation list (CA-BPL) decoder both in error-rate performance and decoding
latency.},
added-at = {2022-05-16T10:09:31.000+0200},
author = {Geiselhart, Marvin and Elkelesh, Ahmed and Clausius, Jannis and Brink, Stephan ten},
biburl = {https://puma.ub.uni-stuttgart.de/bibtex/258e5de3dfe3431f74b48e0667a3e347a/inue},
description = {[2205.06631] A Polar Subcode Approach to Belief Propagation List Decoding},
interhash = {d4417c9ce8e9401b9147d2aaed2e4851},
intrahash = {58e5de3dfe3431f74b48e0667a3e347a},
keywords = {myown from:mgeiselhart},
note = {arxiv:2205.06631Comment: 6 pages, submitted to IEEE for possible publication},
timestamp = {2022-05-16T08:09:31.000+0200},
title = {A Polar Subcode Approach to Belief Propagation List Decoding},
url = {http://arxiv.org/abs/2205.06631},
year = 2022
}