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

SiPS ... design and implementation - IEEE Workshop on Signal Processing Systems

A Channel-Blind Decoding for LDPC Based on Deep Learning and Dictionary Learning

Xu Pang, Chao Yang, Zaichen Zhang, Xiaohu You, Chuan Zhang

Published Oct 1, 2019• 8 citations
Publisher

Abstract

Low-density parity-check (LDPC) codes are used to correct encoding errors that occur during transmission, which enjoys an excellent performance. The performance of existing Min-Sum decoders for LDPC codes relies heavily on accurate channel estimation. A two-dimensional blind channel decoding algorithm that does not require precise channel estimation is presented in this paper. The algorithm converts the original one-dimensional signal into a two-dimensional LDPC signal according to the template. Dictionary learning is introduced for pre-filtering, and deep learning is adopted for further denoising and decoding. It is revealed that the two-dimensional blind decoding algorithm has a significant improvement over the traditional belief propagation (BP) decoding algorithm when the channel noise is unknown. Moreover, the combination of dictionary learning and deep learning has a great improvement in performance and data size reduction.

DOI
10.1109/sips47522.2019.9020628

Related papers

LDPC long code decoding with neural normalized min-sum based on deep learning

Jia Di, Yan Wei, Saijie Yao +2 more

LDPC code is a widely-used high-performance error correction code. In recent years, LDPC decoding based on deep learning and neural networks becomes a research hotspot. Based on the (512,256) LDPC code of the CCSDS standard, this paper firstly studies the traditional decoding algorithms of SP, MS, NMS, and OMS, laying a foundation for the construction of neural networks. Then a data-driven (DD) decoding method is studied which adopts the information with its encoded, modulated and noise-added LDPC code as the training data within a Multi-layer Perceptron (MLP) neural network. In order to solve the problem of high bit error rate (BER) in data-driven method, the Neural Normalized Min-sum (NNMS) decoding in which the NMS algorithm is mapped to the neural network structure is proposed, achieving more excellent BER performance than that of NMS. The BER declines by 85.19% when channel SNR equals to 3.5 dB. Finally, improved training methods to enhance the SNR generalization ability of the NNMS network is studied.

•Dec 1, 2024•0 citations

A Deep Learning-Aided Post-Processing Scheme to Lower the Error Floor of LDPC Codes

Jiajun He

Low-density parity-check (LDPC) codes are widely used in a variety of communication systems because of their low complexity iterative decoding and performance approaching Shannon capacity. However, the existence of error floor seriously hinders the application and development of LDPC codes in related fields. In this paper, a deep learning-aided post-processing scheme (DLAPPS) based on Layered Normalized Min-Sum algorithm (LNMSA) is proposed to effectively lower error floor of LDPC codes. LNMSA is used in the first stage, and in the second stage incorrect frames are re-decoded by processing two types of nodes classified by neural networks. Simulation results show that the proposed DLAPPS can significantly improve error correction performance and lower the error floor of LDPC codes while maintaining a relatively low decoding complexity.

IEEE International Conference on Communication Technology (ICCT)•Oct 28, 2020•4 citations

Performance Analysis of Sub-Optimal LDPC Decoder for 5G using Belief Propagation Algorithm

Avinash Subramaniam M, Jay Sejpal, Pasupuleti Rithvij +2 more

Today's modern wireless communication systems demand extensive quality and computational power with an increase in day-to-day data-rate standards. The latest com-munication standards focus on low latency, high throughput, and reliable error correction capabilities which inspired us to explore the 5G New Generation (NR) technology. Low-Density Parity-Check Codes (LDPC) are known to have error correction capabilities that can achieve Shannon's maximum channel ca-pacity. Encoding of LDPC Codes features a sparse property that enables effortless decoding at the receiver end. Advancements in deep learning have helped in estimating the channel noise more accurately. The Iterative Belief Propagation-Convolutional Neural Network (BP-CNN) architecture involves a CNN block which is trained with a quadratic loss function concatenated to a standard BP Decoder. The proposed Iterative BP-CNN architecture with a Batch Normalization layer results in a better performance compared to the Iterative BP-CNN architecture as it standardizes the input to the CNN block and also solves the problem of vanishing gradients during backpropagation.

International Conference on Internet of Everything, Microwave Engineering, Communication and Networks (IEMECON)•Dec 1, 2021•5 citations

Simulation of LDPC Decoding Algorithm Based on Channel Estimation

Fang Mei-yan

LDPC decoding algorithm on channels with memory is of great significance to high speed digital com- munications.Currently used low-density parity-check codes iterative decoding algorithms on channels with memo- ry,such as Belief-Propagation iterative decoding algorithm based on channel estimation,are commonly complex and thus requiring large amount of calculation.In this paper,a min-sum algorithm is firstly introduced into LDPC itera- tive decoding algorithm based on soft noise decisions and channel estimation on hidden Markov noisy channels.Algo- rithm and calculation complexity are effectively reduced by using the functions'characteristics.Simulation results show that the algorithm not only excels conventional Belief-Propagation iterative decoding algorithms that do not concern channel memory,but also outperforms iterative decoding algorithms based on hard noise decisions and channel esti- mation.So a good compromise is made between decoding performance and algorithm complexity with low performance loss,which is useful real time communications.

Jisuanji fangzhen•Jan 1, 2007•0 citations

A Classified Normalized BP-Based Algorithm with 2-Dimensional Correction for LDPC Codes

Zhou Zhong, Shuming Guo, Xiangyang Xu +1 more

A BP-based algorithm with 2-dimensional classified normalized correction is developed to reduce the complexity and improve the performance of decoding algorithm for the low density parity check (LDPC) codes. The algorithm first utilizes classification according to the absolute values of incoming messages in check nodes. Then it uses 2-dimensional normalization to correct the minimum and sub-minimum values. The 2-dimensional normalized factors can be calculated respectively by using probability and statistic theory in the initialization step. Simulation results illustrate that the proposed algorithm achieves better performance in bit error ratio (BER) and average iteration number than normalized BP-based algorithm in the high signal noise ratio (SNR) region, i.e., it can achieve 0.4 dB SNR gain and reduce 20% number of iterations at BER= 5 10  , whose complexity is also much less than that of belief propagation (BP) algorithm. It is concluded that the proposed algorithm offers better tradeoff between performance and complexity.  Index Terms—channel coding theory, density evolution, Iterative decoding algorithm

Journal of Communications•Jan 1, 2013•6 citations

Improved LDPC decoding algorithms based on min-sum algorithm

Y.V. A. C. Kumara, Chandika Bandara Wavegedara

Low-Density Parity check (LDPC) codes offer high-performance error correction near the Shannon limit which employs large code lengths and some iterations in the decoding process. The conventional decoding algorithm of LDPC is the Log Likelihood Ratio based Belief Propagation (LLR BP) which is also known as the `Sum-Product algorithm' which gives the best decoding performance and requires the most computational complexity and implementations with increased hardware complexity. Another simpler variant of this algorithm is used which is known as `min-sum algorithm' which reduces computational complexity as well as hardware complexity but with reduced accuracy. This paper analyzes the reason min-sum algorithm is more prone to errors when compared to the sum-product algorithm, and puts forward two improved algorithms which improve the performance of the min-sum algorithm with comparable algorithmic complexity.

Moratuwa Engineering Research Conference (MERCon)•Apr 1, 2016•8 citations
Low-density parity-check (LDPC) codes are used to correct encoding errors that occur during transmission, which enjoys an excellent performance. The performance of existing Min-Sum decoders for LDPC codes relies heavily on accurate channel estimation. A two-dimensional blind channel decoding algorithm that does not require precise channel estimation is presented in this paper. The algorithm converts the original one-dimensional signal into a two-dimensional LDPC signal according to the template. Dictionary learning is introduced for pre-filtering, and deep learning is adopted for further denoising and decoding. It is revealed that the two-dimensional blind decoding algorithm has a significant improvement over the traditional belief propagation (BP) decoding algorithm when the channel noise is unknown. Moreover, the combination of dictionary learning and deep learning has a great improvement in performance and data size reduction.
LDPC code is a widely-used high-performance error correction code. In recent years, LDPC decoding based on deep learning and neural networks becomes a research hotspot. Based on the (512,256) LDPC code of the CCSDS standard, this paper firstly studies the traditional decoding algorithms of SP, MS, NMS, and OMS, laying a foundation for the construction of neural networks. Then a data-driven (DD) decoding method is studied which adopts the information with its encoded, modulated and noise-added LDPC code as the training data within a Multi-layer Perceptron (MLP) neural network. In order to solve the problem of high bit error rate (BER) in data-driven method, the Neural Normalized Min-sum (NNMS) decoding in which the NMS algorithm is mapped to the neural network structure is proposed, achieving more excellent BER performance than that of NMS. The BER declines by 85.19% when channel SNR equals to 3.5 dB. Finally, improved training methods to enhance the SNR generalization ability of the NNMS network is studied.
Low-density parity-check (LDPC) codes are widely used in a variety of communication systems because of their low complexity iterative decoding and performance approaching Shannon capacity. However, the existence of error floor seriously hinders the application and development of LDPC codes in related fields. In this paper, a deep learning-aided post-processing scheme (DLAPPS) based on Layered Normalized Min-Sum algorithm (LNMSA) is proposed to effectively lower error floor of LDPC codes. LNMSA is used in the first stage, and in the second stage incorrect frames are re-decoded by processing two types of nodes classified by neural networks. Simulation results show that the proposed DLAPPS can significantly improve error correction performance and lower the error floor of LDPC codes while maintaining a relatively low decoding complexity.
Today's modern wireless communication systems demand extensive quality and computational power with an increase in day-to-day data-rate standards. The latest com-munication standards focus on low latency, high throughput, and reliable error correction capabilities which inspired us to explore the 5G New Generation (NR) technology. Low-Density Parity-Check Codes (LDPC) are known to have error correction capabilities that can achieve Shannon's maximum channel ca-pacity. Encoding of LDPC Codes features a sparse property that enables effortless decoding at the receiver end. Advancements in deep learning have helped in estimating the channel noise more accurately. The Iterative Belief Propagation-Convolutional Neural Network (BP-CNN) architecture involves a CNN block which is trained with a quadratic loss function concatenated to a standard BP Decoder. The proposed Iterative BP-CNN architecture with a Batch Normalization layer results in a better performance compared to the Iterative BP-CNN architecture as it standardizes the input to the CNN block and also solves the problem of vanishing gradients during backpropagation.
LDPC decoding algorithm on channels with memory is of great significance to high speed digital com- munications.Currently used low-density parity-check codes iterative decoding algorithms on channels with memo- ry,such as Belief-Propagation iterative decoding algorithm based on channel estimation,are commonly complex and thus requiring large amount of calculation.In this paper,a min-sum algorithm is firstly introduced into LDPC itera- tive decoding algorithm based on soft noise decisions and channel estimation on hidden Markov noisy channels.Algo- rithm and calculation complexity are effectively reduced by using the functions'characteristics.Simulation results show that the algorithm not only excels conventional Belief-Propagation iterative decoding algorithms that do not concern channel memory,but also outperforms iterative decoding algorithms based on hard noise decisions and channel esti- mation.So a good compromise is made between decoding performance and algorithm complexity with low performance loss,which is useful real time communications.
A BP-based algorithm with 2-dimensional classified normalized correction is developed to reduce the complexity and improve the performance of decoding algorithm for the low density parity check (LDPC) codes. The algorithm first utilizes classification according to the absolute values of incoming messages in check nodes. Then it uses 2-dimensional normalization to correct the minimum and sub-minimum values. The 2-dimensional normalized factors can be calculated respectively by using probability and statistic theory in the initialization step. Simulation results illustrate that the proposed algorithm achieves better performance in bit error ratio (BER) and average iteration number than normalized BP-based algorithm in the high signal noise ratio (SNR) region, i.e., it can achieve 0.4 dB SNR gain and reduce 20% number of iterations at BER= 5 10  , whose complexity is also much less than that of belief propagation (BP) algorithm. It is concluded that the proposed algorithm offers better tradeoff between performance and complexity.  Index Terms—channel coding theory, density evolution, Iterative decoding algorithm
Low-Density Parity check (LDPC) codes offer high-performance error correction near the Shannon limit which employs large code lengths and some iterations in the decoding process. The conventional decoding algorithm of LDPC is the Log Likelihood Ratio based Belief Propagation (LLR BP) which is also known as the `Sum-Product algorithm' which gives the best decoding performance and requires the most computational complexity and implementations with increased hardware complexity. Another simpler variant of this algorithm is used which is known as `min-sum algorithm' which reduces computational complexity as well as hardware complexity but with reduced accuracy. This paper analyzes the reason min-sum algorithm is more prone to errors when compared to the sum-product algorithm, and puts forward two improved algorithms which improve the performance of the min-sum algorithm with comparable algorithmic complexity.