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

IEICE Technical Report; IEICE Tech. Rep.

Iterative Decoding with Bias Terms for LDPC Codes

Hiroshi Kamabe, Shusaku Kobota

Published Dec 31, 2009• 0 citations
OpenAlex

Related papers

Iterative decoding of LDPC codes: some bounds and properties

David Burshtein, Gadi Miller

Physica A Statistical Mechanics and its Applications•Dec 1, 2001•0 citations

Learning to Decode LDPC Codes with Finite-Alphabet Message Passing

Bane V. Vasic, Xin Wei Xiao, Shu Lin

In this paper, we discuss the perspectives of utilizing deep neural networks (DNN) to decode Low-Density Parity Check (LDPC) codes. The main idea is to build a neural network to learn and optimize a conventional iterative decoder of LDPC codes. A DNN is based on Tanner graph, and the activation functions emulate message update functions in variable and check nodes. We impose a symmetry on weight matrices which makes it possible to train the DNN on a single codeword and noise realizations only. Based on the trained weights and the bias, we further quantize messages in such DNN-based decoder with 3-bit precision while maintaining no loss in error performance compared to the min-sum algorithm. We use examples to present that the DNN framework can be applied to various code lengths. The simulation results show that, the trained weights and bias make the iterative DNN decoder converge faster and thus achieve higher throughput at the cost of trivial additional decoding complexity.

Information Theory and Applications Workshop (ITA)•Feb 1, 2018•34 citations

Iterative Decoding of LDPC Codes with Convex Optimization and Min-Sum Decoding

Tomoaki Oiki, Ryutaroh Matsumoto, Tomohiko Uyematsu

IEICE Technical Report; IEICE Tech. Rep.•Jan 11, 2011•0 citations

Design of LDPC code ensembles with fast convergence properties

Ian P. Mulholland, Enrico Paolini, Mark F. Flanagan

The design of low-density parity-check (LDPC) code ensembles optimized for a finite number of decoder iterations is investigated. Our approach employs EXIT chart analysis and differential evolution to design such ensembles for the binary erasure channel and additive white Gaussian noise channel. The error rates of codes optimized for various numbers of decoder iterations are compared and it is seen that in the cases considered, the best performance for a given number of decoder iterations is achieved by codes which are optimized for this particular number. The design of generalized LDPC (GLDPC) codes is also considered, showing that these structures can offer better performance than LDPC codes for low-iteration-number designs. Finally, it is illustrated that LDPC codes which are optimized for a small number of iterations exhibit significant deviations in terms of degree distribution and weight enumerators with respect to LDPC codes returned by more conventional design tools.

arXiv:1410.4086•IEEE International Black Sea Conference on Communications and Networking•May 1, 2015•18 citations

Iterative Decoding of LDPCC

Marco Chiani

•Jun 1, 2010•0 citations

Decoding of short non-binary LDPC codes using a non iterative decoding algorithm

Mahmoud El Kobi, Mohamad Zein, Ali Chamas Al Ghouwayel +1 more

In this paper, we investigate the decoding of short Non-Binary (NB)-LDPC codes of rate 1/2 using a non-iterative approach based on the Maximum-Likelihood (ML) principle. The traditional decoding algorithms used to decode the NB-LDPC codes are by nature iterative where the Variables Nodes (VN) and Check Nodes (CN) exchange data iteratively during, at least, eight iterations which imposes a long decoding time to achieve good performance in terms of Frame Error Rate (FER). In this paper we propose a decoding algorithm based on the Maximum Likelihood (ML) search named Near ML approach where the number of tested words considered as potential codewords is highly reduced. Simulation of codes of lengths 16 and 48 are presented and the results show that the proposed algorithm achieves the performance offered by the EMS algorithm. The NB-LDPC of length 16 is shown to outperform the EMS algorithm.

International Conference on e-Technologies and Networks for Development (ICeND)•Apr 1, 2014•0 citations
In this paper, we discuss the perspectives of utilizing deep neural networks (DNN) to decode Low-Density Parity Check (LDPC) codes. The main idea is to build a neural network to learn and optimize a conventional iterative decoder of LDPC codes. A DNN is based on Tanner graph, and the activation functions emulate message update functions in variable and check nodes. We impose a symmetry on weight matrices which makes it possible to train the DNN on a single codeword and noise realizations only. Based on the trained weights and the bias, we further quantize messages in such DNN-based decoder with 3-bit precision while maintaining no loss in error performance compared to the min-sum algorithm. We use examples to present that the DNN framework can be applied to various code lengths. The simulation results show that, the trained weights and bias make the iterative DNN decoder converge faster and thus achieve higher throughput at the cost of trivial additional decoding complexity.
The design of low-density parity-check (LDPC) code ensembles optimized for a finite number of decoder iterations is investigated. Our approach employs EXIT chart analysis and differential evolution to design such ensembles for the binary erasure channel and additive white Gaussian noise channel. The error rates of codes optimized for various numbers of decoder iterations are compared and it is seen that in the cases considered, the best performance for a given number of decoder iterations is achieved by codes which are optimized for this particular number. The design of generalized LDPC (GLDPC) codes is also considered, showing that these structures can offer better performance than LDPC codes for low-iteration-number designs. Finally, it is illustrated that LDPC codes which are optimized for a small number of iterations exhibit significant deviations in terms of degree distribution and weight enumerators with respect to LDPC codes returned by more conventional design tools.
In this paper, we investigate the decoding of short Non-Binary (NB)-LDPC codes of rate 1/2 using a non-iterative approach based on the Maximum-Likelihood (ML) principle. The traditional decoding algorithms used to decode the NB-LDPC codes are by nature iterative where the Variables Nodes (VN) and Check Nodes (CN) exchange data iteratively during, at least, eight iterations which imposes a long decoding time to achieve good performance in terms of Frame Error Rate (FER). In this paper we propose a decoding algorithm based on the Maximum Likelihood (ML) search named Near ML approach where the number of tested words considered as potential codewords is highly reduced. Simulation of codes of lengths 16 and 48 are presented and the results show that the proposed algorithm achieves the performance offered by the EMS algorithm. The NB-LDPC of length 16 is shown to outperform the EMS algorithm.