%0 Conference Paper %1 9174249 %A Geiselhart, Marvin %A Elkelesh, Ahmed %A Ebada, Moustafa %A Cammerer, Sebastian %A ten Brink, Stephan %B 2020 IEEE International Symposium on Information Theory (ISIT) %D 2020 %K myown %P 395-400 %R 10.1109/ISIT44484.2020.9174249 %T CRC-Aided Belief Propagation List Decoding of Polar Codes %U https://ieeexplore.ieee.org/document/9174249 %X Although iterative decoding of polar codes has recently made huge progress based on the idea of permuted factor graphs, it still suffers from a non-negligible performance degradation when compared to state-of-the-art CRC-aided successive cancellation list (CA-SCL) decoding. In this work, we show that iterative decoding of polar codes based on the belief propagation list (BPL) algorithm can approach the error-rate performance of CA-SCL decoding and, thus, can be efficiently used for decoding the standardized 5G polar codes. Rather than only utilizing the cyclic redundancy check (CRC) as a stopping condition (i.e., for error-detection), we also aim to benefit from the error-correction capabilities of the outer CRC code. For this, we develop two distinct soft-decision CRC decoding algorithms: a Bahl-Cocke-Jelinek-Raviv (BCJR)-based approach and a sum product algorithm (SPA)-based approach. Further, an optimized selection of permuted factor graphs is analyzed and shown to reduce the decoding complexity significantly. Finally, we benchmark the proposed CRC-aided belief propagation list (CA-BPL) decoding to state-of-the-art 5G polar codes under CA-SCL decoding and, thereby, showcase an error-rate performance not just close to the CA-SCL but also close to the maximum likelihood (ML) bound as estimated by ordered statistic decoding (OSD).

@inproceedings{9174249, abstract = {Although iterative decoding of polar codes has recently made huge progress based on the idea of permuted factor graphs, it still suffers from a non-negligible performance degradation when compared to state-of-the-art CRC-aided successive cancellation list (CA-SCL) decoding. In this work, we show that iterative decoding of polar codes based on the belief propagation list (BPL) algorithm can approach the error-rate performance of CA-SCL decoding and, thus, can be efficiently used for decoding the standardized 5G polar codes. Rather than only utilizing the cyclic redundancy check (CRC) as a stopping condition (i.e., for error-detection), we also aim to benefit from the error-correction capabilities of the outer CRC code. For this, we develop two distinct soft-decision CRC decoding algorithms: a Bahl-Cocke-Jelinek-Raviv (BCJR)-based approach and a sum product algorithm (SPA)-based approach. Further, an optimized selection of permuted factor graphs is analyzed and shown to reduce the decoding complexity significantly. Finally, we benchmark the proposed CRC-aided belief propagation list (CA-BPL) decoding to state-of-the-art 5G polar codes under CA-SCL decoding and, thereby, showcase an error-rate performance not just close to the CA-SCL but also close to the maximum likelihood (ML) bound as estimated by ordered statistic decoding (OSD).}, added-at = {2021-06-17T09:53:11.000+0200}, author = {Geiselhart, Marvin and Elkelesh, Ahmed and Ebada, Moustafa and Cammerer, Sebastian and ten Brink, Stephan}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/2277347de2d0f97fdffe6568ab4f10a74/mgeiselhart}, booktitle = {2020 IEEE International Symposium on Information Theory (ISIT)}, description = {CRC-Aided Belief Propagation List Decoding of Polar Codes | IEEE Conference Publication | IEEE Xplore}, doi = {10.1109/ISIT44484.2020.9174249}, interhash = {a139b380d1a4d4d834ae25ce320f560b}, intrahash = {277347de2d0f97fdffe6568ab4f10a74}, issn = {2157-8117}, keywords = {myown}, month = {June}, pages = {395-400}, timestamp = {2021-06-17T07:55:29.000+0200}, title = {CRC-Aided Belief Propagation List Decoding of Polar Codes}, url = {https://ieeexplore.ieee.org/document/9174249}, year = 2020 }