We present a new framework for constructing polar codes (i.e., selecting the frozen bit positions) for arbitrary channels, tailored to a given decoding algorithm rather than assuming the (not necessarily optimal) successive cancellation (SC) decoding. The proposed framework is based on the genetic algorithm (GenAlg), where populations (i.e., collections) of information sets evolve via evolutionary transformations based on their individual error-rate performance. These populations converge toward an information set that fits both the decoding behavior and the defined channel. We construct polar codes, without the CRC-aid, tailored to plain successive cancellation list (SCL) decoding, achieving the same error-rate performance as the CRC-aided SCL decoding over both the AWGN channel and the Rayleigh channel, respectively. Furthermore, a proposed belief propagation (BP)-tailored construction approaches the SCL error-rate performance without any modifications in the decoding algorithm itself. The performance gains can be attributed to the significant reduction in the number of low-weight codewords. We show that, when required, the GenAlg can also be set up to find codes that reduce the decoding complexity. This way, the SCL list size or the number of BP iterations can be reduced while maintaining the same error-rate performance.
%0 Journal Article
%1 elkelesh2019decodertailored
%A Elkelesh, Ahmed
%A Ebada, Moustafa
%A Cammerer, Sebastian
%A ten Brink, Stephan
%D 2019
%I IEEE
%J IEEE Transactions on Communications
%K sent ubs_10005 ubs_20007 ubs_30073 ubs_40406 unibibliografie
%N 7
%P 4521-4534
%R 10.1109/TCOMM.2019.2908870
%T Decoder-Tailored Polar Code Design Using the Genetic Algorithm
%V 67
%X We present a new framework for constructing polar codes (i.e., selecting the frozen bit positions) for arbitrary channels, tailored to a given decoding algorithm rather than assuming the (not necessarily optimal) successive cancellation (SC) decoding. The proposed framework is based on the genetic algorithm (GenAlg), where populations (i.e., collections) of information sets evolve via evolutionary transformations based on their individual error-rate performance. These populations converge toward an information set that fits both the decoding behavior and the defined channel. We construct polar codes, without the CRC-aid, tailored to plain successive cancellation list (SCL) decoding, achieving the same error-rate performance as the CRC-aided SCL decoding over both the AWGN channel and the Rayleigh channel, respectively. Furthermore, a proposed belief propagation (BP)-tailored construction approaches the SCL error-rate performance without any modifications in the decoding algorithm itself. The performance gains can be attributed to the significant reduction in the number of low-weight codewords. We show that, when required, the GenAlg can also be set up to find codes that reduce the decoding complexity. This way, the SCL list size or the number of BP iterations can be reduced while maintaining the same error-rate performance.
@article{elkelesh2019decodertailored,
abstract = {We present a new framework for constructing polar codes (i.e., selecting the frozen bit positions) for arbitrary channels, tailored to a given decoding algorithm rather than assuming the (not necessarily optimal) successive cancellation (SC) decoding. The proposed framework is based on the genetic algorithm (GenAlg), where populations (i.e., collections) of information sets evolve via evolutionary transformations based on their individual error-rate performance. These populations converge toward an information set that fits both the decoding behavior and the defined channel. We construct polar codes, without the CRC-aid, tailored to plain successive cancellation list (SCL) decoding, achieving the same error-rate performance as the CRC-aided SCL decoding over both the AWGN channel and the Rayleigh channel, respectively. Furthermore, a proposed belief propagation (BP)-tailored construction approaches the SCL error-rate performance without any modifications in the decoding algorithm itself. The performance gains can be attributed to the significant reduction in the number of low-weight codewords. We show that, when required, the GenAlg can also be set up to find codes that reduce the decoding complexity. This way, the SCL list size or the number of BP iterations can be reduced while maintaining the same error-rate performance.},
added-at = {2020-03-24T12:10:09.000+0100},
author = {Elkelesh, Ahmed and Ebada, Moustafa and Cammerer, Sebastian and ten Brink, Stephan},
biburl = {https://puma.ub.uni-stuttgart.de/bibtex/228a4971cdc196d2fbcf1961b0ce524f9/unibiblio},
doi = {10.1109/TCOMM.2019.2908870},
interhash = {6f7e0258bd161acc837bb33af588ecb3},
intrahash = {28a4971cdc196d2fbcf1961b0ce524f9},
issn = {1558-0857},
journal = {IEEE Transactions on Communications},
keywords = {sent ubs_10005 ubs_20007 ubs_30073 ubs_40406 unibibliografie},
language = {eng},
number = 7,
pages = {4521-4534},
publisher = {IEEE},
timestamp = {2020-03-24T11:10:09.000+0100},
title = {Decoder-Tailored Polar Code Design Using the Genetic Algorithm},
volume = 67,
year = 2019
}