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

International journal of scientific and technology research

Computationally Simpler And Fast Convergence Algorithm For Neural Network Based Ldpc Encoder/ Decoder

N. M. Nandhitha

Published Aug 25, 2019• 0 citations
OpenAlex

Related papers

Fast-convergence architectures and low-complexity algorithms for LDPC decoding

Massimo Rovini, Luca Fanucci, Francesco Rossi

•Jan 1, 2006•0 citations

Research on the Application of LDPC Decoding Algorithm Based on Neural Network

Hong Zhang

IEEE International Conference on Applied Mathematics, Modeling and Computer Simulation (AMMCS)•Aug 23, 2025•0 citations

A Novel Simplified Implementation of LDPC Decoding Using Neural Networks

Behzad Momahed Heravi, Bahram Honary

•Sep 1, 2006•0 citations

Customized Branched Neural Network-Aided Shuffled Min-Sum Decoder for Protograph LDPC Codes

Yurong Wang, Liang Lv, Yi Fang +2 more

The paper designs a novel neural shuffled min-sum (NSMS) decoder with the model-driven deep learning method to achieve higher efficient and lower complexity decoding for protograph low-density parity-check (LDPC) codes. We propose a new type of customized branched neural network (CBNN) structure, which integrates shuffled min-sum (SMS) decoding algorithm and shuffled belief-propagation (SBP) decoding algorithm. In such a network structure, we can adjust layer arrangement and simplify parameter groups at a specific stage (i.e., training or inference stage) to reduce the unwarranted computational workload. Furthermore, we utilize the branched neuron mean difference (BNMD) to optimize the training targets of the proposed NSMS decoder, which significantly accelerates the convergence speed of the network. Analytical and simulation results show that the proposed NSMS decoder can achieve better performance than the state-of-the-art counterparts in terms of convergence speed, error rate and computational complexity.

IEEE Transactions on Vehicular Technology•Sep 12, 2024•1 citation

An LDPC Decoding Method Using a Neural Network as a De-Mapper

Shuailong Zhu, Lijun Zhang

In this paper, we propose a novel LDPC decoding model that employs a fully connected neural network as a demapper to achieve excellent decoding performance while maintaining low computational complexity and computational effort. This neural network model does not need to rely on external coding during the training process, thus significantly reducing the required computational resources. In addition, the model can quickly converge to a parameter configuration with excellent performance through a limited number of iterations. To further enhance the decoding results, this paper also combines this neural demapper with a modified version of the confidence propagation (BP) algorithm. The integrated model achieves excellent decoding performance while keeping the computational load low, even under more stringent conditions.

International Academic Exchange Conference on Science and Technology Innovation (IAECST)•Dec 6, 2024•0 citations

Threshold-Controlled Residual Decoding for LDPC Codes via a Weight-Shared Neural Network

Hua Zhou, Likang Zhang

IEEE Communications Letters•Jan 1, 2026•0 citations
The paper designs a novel neural shuffled min-sum (NSMS) decoder with the model-driven deep learning method to achieve higher efficient and lower complexity decoding for protograph low-density parity-check (LDPC) codes. We propose a new type of customized branched neural network (CBNN) structure, which integrates shuffled min-sum (SMS) decoding algorithm and shuffled belief-propagation (SBP) decoding algorithm. In such a network structure, we can adjust layer arrangement and simplify parameter groups at a specific stage (i.e., training or inference stage) to reduce the unwarranted computational workload. Furthermore, we utilize the branched neuron mean difference (BNMD) to optimize the training targets of the proposed NSMS decoder, which significantly accelerates the convergence speed of the network. Analytical and simulation results show that the proposed NSMS decoder can achieve better performance than the state-of-the-art counterparts in terms of convergence speed, error rate and computational complexity.
In this paper, we propose a novel LDPC decoding model that employs a fully connected neural network as a demapper to achieve excellent decoding performance while maintaining low computational complexity and computational effort. This neural network model does not need to rely on external coding during the training process, thus significantly reducing the required computational resources. In addition, the model can quickly converge to a parameter configuration with excellent performance through a limited number of iterations. To further enhance the decoding results, this paper also combines this neural demapper with a modified version of the confidence propagation (BP) algorithm. The integrated model achieves excellent decoding performance while keeping the computational load low, even under more stringent conditions.