Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Asia-Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA ASC)

Deep Unfolding-Aided Sum-Product Algorithm for Error Correction of CRC Coded Short Message

Qilin Zhang, Shinsuke Ibi, Takumi Takahashi, Hisato Iwai

Published Nov 7, 2022• 2 citations
Publisher

Abstract

This paper proposes a deep unfolding-aided sum-product algorithm (SPA) for error correction decoding of cyclic redundancy check (CRC) coded short message. SPA is a practical decoding algorithm for linear codes without requiring enormous computational complexity. However, if the SPA is used as it is for CRC codes, belief correlation and outliers will be induced in the iterative decoding process, resulting in lousy correction capability. To compensate for this drawback, we design a SPA-based decoding process for CRC code that incorporates a data-driven design based on deep learning and learning optimization of in-ternal trainable parameters. Considering the operation principle of soft-decision decoder, a novel loss function based on a weighted average of negentropy, which is a key measure to evaluate the Gaussianity, and BCE of the decoder output is proposed. Numerical results show that the proposed algorithm improves the bit error rate (BER) performance with deep unfolding and negentropy-aware loss function.

DOI
10.23919/apsipaasc55919.2022.9979875

Related papers

CRC-Aided Belief Propagation List Decoding of Polar Codes

Marvin Geiselhart, Ahmed Elkelesh, Moustafa Ebada +2 more

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).

arXiv:2001.05303•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2020•56 citations

Exploiting Error-Correction-CRC for Polar SCL Decoding: A Deep Learning-Based Approach

Xijin Liu, Shaohua Wu, Ye Wang +3 more

We investigate the cyclic redundancy check (CRC) codes aided successive cancellation list (SCL) decoding schemes to improve the performance of Polar codes. Distinguished from the existing literatures of Polar codes that only consider the error detection capability of CRC, we attempt to take advantage of the inherent error correction capability of CRC and we first devise a segmented CRC-error-correcting aided SCL decoding (SCC-SCL) framework. Based on this framework, an error-correcting table based SCC-SCL (ET-SCC-SCL) decoding scheme is proposed, by introducing the look-up-table based CRC error correction method into the segmented Polar SCL decoding process. Since the error correction capability is limited by the size of the look-up table, which in turn limits the performance gain, we further propose a deep learning based SCC-SCL (DL-SCC-SCL) decoding scheme. In this scheme, a long short-term memory (LSTM) network replaces the error correction table to perform error correction, combining the sequence of log likelihood ratios (LLRs) with the syndromes to determine the error patterns. Simulation results show that both of the proposed decoding schemes have significant performance gain over the classic CRC error-detection aided SCL decoding scheme. Especially for the DL-SCC-SCL, the performance gain at bit error rate of 10-5is about 0.5 dB.

IEEE Transactions on Cognitive Communications and Networking•Oct 9, 2019•29 citations

Neural Belief Propagation Decoding of CRC-Polar Concatenated Codes

Nghia Doan, Seyyed Ali Hashemi, Elie Ngomseu Mambou +2 more

Polar codes are the first class of error correcting codes that provably achieve the channel capacity at infinite code length. They were selected for use in the fifth generation of cellular mobile communications (5G). In practical scenarios such as 5G, a cyclic redundancy check (CRC) is concatenated with polar codes to improve their finite length performance. This is mostly beneficial for sequential successive-cancellation list decoders. However, for parallel iterative belief propagation (BP) decoders, CRC is only used as an early stopping criterion with incremental error-correction performance improvement. In this paper, we first propose a CRC-polar BP (CPBP) decoder by exchanging the extrinsic information between the factor graph of the polar code and that of the CRC. We then propose a neural CPBP (NCPBP) algorithm which improves the CPBP decoder by introducing trainable normalizing weights on the concatenated factor graph. Our results on a 5G polar code of length 128 show that at the frame error rate of 10-5and with a maximum of 30 iterations, the error-correction performance of CPBP and NCPBP are approximately 0.25 dB and 0.5 dB better than that of the conventional CRC-aided BP decoder, respectively, while introducing almost no latency overhead.

arXiv:1811.00124•International Conference on Communications•May 1, 2019•60 citations

Improved Perturbation Method for Decoding of LDPC Aided by CRC

Si Si, Shu, Daiming +1 more

In this paper, a fresh belief propagation (BP) decoding algorithm is proposed. The proposed decoding algorithm with improved perturbation method is designed for short length low density parity-check (LDPC) codes aided by cyclic redundancy check (CRC). In the proposed algorithm corresponding to path size L, L decoding paths are considered concurrently. Then, a single codeword is selected according to the checking results of CRC. Simulation results show that the modified CRC-aided decoding scheme can enhance the error-correcting performance of short LDPC codes effectively.

•Jan 1, 2014•2 citations

Segmented CRC-Aided Order Statistical Decoding with Multiple Biases for Short Polar Codes

Hao Tang, Ming Zhan, Liangxi Liu +4 more

With the advent of 5th generation (5G) mobile communication era, higher requirements are put forward for ultra-reliable and low-latency transmission compared with 4G, especially in the field of short packet communication. In this paper, we propose a segmented cyclic redundancy check aided order statistical decoding algorithm with multiple biases (BIAS- SCRC-OSD) for short polar codes. This algorithm constructs multiple information sets by repeatedly adding bias value, and selects more effective information sets to improve the decoding performance. For further improving the decoding performance, we change the original cyclic redundancy check (CRC) into segment check. The simulation results show that a suitable bias value can significantly improve the decoding performance with a small increase in computational complexity. Compared with the original CRC-aided order statistical decoding (OSD) algorithm, the proposed algorithm has a gain of about 0.8 dB at target bit error rate (BER) 10-4with code rate R = 0.5 and code length N = 64.

International Conference on Information Science and Technology•May 21, 2021•0 citations

CRC-Aided Adaptive Belief Propagation Decoding of NR LDPC Codes

Xianwen Zhang, Ming Jiang, Mingyang Zhu +2 more

In this paper, we focus on how to further improve the performance of short block-length low-density parity-check (LDPC) codes, especially the short LDPC codes in 5th generation (5G) New Radio (NR) systems. We propose an enhanced adaptive belief propagation (ABP) decoding algorithm with the assistance of partial cyclic redundancy check (CRC) bits. Meanwhile, the error detection ability can still be guaranteed by the remaining CRC bits and adaptive decoder parameters. Moreover, the proposed partial CRC-aided ABP (CA-ABP) decoding can be combined with the conventional BP decoding to further improve the performance. Simulation results show that compared with the BP decoding our proposed decoding method achieves an improvement in the error-correction performance.

IEEE Vehicular Technology Conference•Jun 1, 2022•3 citations
This paper proposes a deep unfolding-aided sum-product algorithm (SPA) for error correction decoding of cyclic redundancy check (CRC) coded short message. SPA is a practical decoding algorithm for linear codes without requiring enormous computational complexity. However, if the SPA is used as it is for CRC codes, belief correlation and outliers will be induced in the iterative decoding process, resulting in lousy correction capability. To compensate for this drawback, we design a SPA-based decoding process for CRC code that incorporates a data-driven design based on deep learning and learning optimization of in-ternal trainable parameters. Considering the operation principle of soft-decision decoder, a novel loss function based on a weighted average of negentropy, which is a key measure to evaluate the Gaussianity, and BCE of the decoder output is proposed. Numerical results show that the proposed algorithm improves the bit error rate (BER) performance with deep unfolding and negentropy-aware loss function.
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).
We investigate the cyclic redundancy check (CRC) codes aided successive cancellation list (SCL) decoding schemes to improve the performance of Polar codes. Distinguished from the existing literatures of Polar codes that only consider the error detection capability of CRC, we attempt to take advantage of the inherent error correction capability of CRC and we first devise a segmented CRC-error-correcting aided SCL decoding (SCC-SCL) framework. Based on this framework, an error-correcting table based SCC-SCL (ET-SCC-SCL) decoding scheme is proposed, by introducing the look-up-table based CRC error correction method into the segmented Polar SCL decoding process. Since the error correction capability is limited by the size of the look-up table, which in turn limits the performance gain, we further propose a deep learning based SCC-SCL (DL-SCC-SCL) decoding scheme. In this scheme, a long short-term memory (LSTM) network replaces the error correction table to perform error correction, combining the sequence of log likelihood ratios (LLRs) with the syndromes to determine the error patterns. Simulation results show that both of the proposed decoding schemes have significant performance gain over the classic CRC error-detection aided SCL decoding scheme. Especially for the DL-SCC-SCL, the performance gain at bit error rate of 10-5is about 0.5 dB.
Polar codes are the first class of error correcting codes that provably achieve the channel capacity at infinite code length. They were selected for use in the fifth generation of cellular mobile communications (5G). In practical scenarios such as 5G, a cyclic redundancy check (CRC) is concatenated with polar codes to improve their finite length performance. This is mostly beneficial for sequential successive-cancellation list decoders. However, for parallel iterative belief propagation (BP) decoders, CRC is only used as an early stopping criterion with incremental error-correction performance improvement. In this paper, we first propose a CRC-polar BP (CPBP) decoder by exchanging the extrinsic information between the factor graph of the polar code and that of the CRC. We then propose a neural CPBP (NCPBP) algorithm which improves the CPBP decoder by introducing trainable normalizing weights on the concatenated factor graph. Our results on a 5G polar code of length 128 show that at the frame error rate of 10-5and with a maximum of 30 iterations, the error-correction performance of CPBP and NCPBP are approximately 0.25 dB and 0.5 dB better than that of the conventional CRC-aided BP decoder, respectively, while introducing almost no latency overhead.
In this paper, a fresh belief propagation (BP) decoding algorithm is proposed. The proposed decoding algorithm with improved perturbation method is designed for short length low density parity-check (LDPC) codes aided by cyclic redundancy check (CRC). In the proposed algorithm corresponding to path size L, L decoding paths are considered concurrently. Then, a single codeword is selected according to the checking results of CRC. Simulation results show that the modified CRC-aided decoding scheme can enhance the error-correcting performance of short LDPC codes effectively.
With the advent of 5th generation (5G) mobile communication era, higher requirements are put forward for ultra-reliable and low-latency transmission compared with 4G, especially in the field of short packet communication. In this paper, we propose a segmented cyclic redundancy check aided order statistical decoding algorithm with multiple biases (BIAS- SCRC-OSD) for short polar codes. This algorithm constructs multiple information sets by repeatedly adding bias value, and selects more effective information sets to improve the decoding performance. For further improving the decoding performance, we change the original cyclic redundancy check (CRC) into segment check. The simulation results show that a suitable bias value can significantly improve the decoding performance with a small increase in computational complexity. Compared with the original CRC-aided order statistical decoding (OSD) algorithm, the proposed algorithm has a gain of about 0.8 dB at target bit error rate (BER) 10-4with code rate R = 0.5 and code length N = 64.
In this paper, we focus on how to further improve the performance of short block-length low-density parity-check (LDPC) codes, especially the short LDPC codes in 5th generation (5G) New Radio (NR) systems. We propose an enhanced adaptive belief propagation (ABP) decoding algorithm with the assistance of partial cyclic redundancy check (CRC) bits. Meanwhile, the error detection ability can still be guaranteed by the remaining CRC bits and adaptive decoder parameters. Moreover, the proposed partial CRC-aided ABP (CA-ABP) decoding can be combined with the conventional BP decoding to further improve the performance. Simulation results show that compared with the BP decoding our proposed decoding method achieves an improvement in the error-correction performance.