CRC-Aided Belief Propagation List Decoding of Polar Codes
Authors:
- 1 June 2020
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 395-400
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).Keywords
All Related Versions
This publication has 20 references indexed in Scilit:
- Mitigating clipping effects on error floors under belief propagation decoding of polar codes2017
- Combining belief propagation and successive cancellation list decoding of polar codes on a GPU platform2017
- Architecture and optimization of high-throughput belief propagation decoding of polar codes2016
- List Decoding of Polar CodesIEEE Transactions on Information Theory, 2015
- Early Stopping Criteria for Energy-Efficient Low-Latency Belief-Propagation Polar Code DecodersIEEE Transactions on Signal Processing, 2014
- Enhanced belief propagation decoding of polar codes through concatenation2014
- Channel Codes2009
- Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless ChannelsIEEE Transactions on Information Theory, 2009
- Soft-decision decoding of linear block codes based on ordered statisticsIEEE Transactions on Information Theory, 1995
- Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)IEEE Transactions on Information Theory, 1974