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
A Polar Subcode Approach to Belief Propagation List Decoding | IEEE Conference Publication | IEEE Xplore
%0 Conference Paper
%1 9965915
%A Geiselhart, Marvin
%A Elkelesh, Ahmed
%A Clausius, Jannis
%A Brink, Stephan ten
%B 2022 IEEE Information Theory Workshop (ITW)
%D 2022
%K myown from:mgeiselhart
%P 243-248
%R 10.1109/ITW54588.2022.9965915
%T A Polar Subcode Approach to Belief Propagation List Decoding
%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.
@inproceedings{9965915,
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-12-09T14:50:36.000+0100},
author = {Geiselhart, Marvin and Elkelesh, Ahmed and Clausius, Jannis and Brink, Stephan ten},
biburl = {https://puma.ub.uni-stuttgart.de/bibtex/2a6d3691212d46195135f3d8a7b19351f/inue},
booktitle = {2022 IEEE Information Theory Workshop (ITW)},
description = {A Polar Subcode Approach to Belief Propagation List Decoding | IEEE Conference Publication | IEEE Xplore},
doi = {10.1109/ITW54588.2022.9965915},
interhash = {d4417c9ce8e9401b9147d2aaed2e4851},
intrahash = {a6d3691212d46195135f3d8a7b19351f},
keywords = {myown from:mgeiselhart},
month = nov,
pages = {243-248},
timestamp = {2022-12-09T13:50:36.000+0100},
title = {A Polar Subcode Approach to Belief Propagation List Decoding},
year = 2022
}
