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

On the usage of statistical analysis for the number of decoding iterations in LDPC codes

Marco Baldi, Franco Chiaraluce, Roberto Garello

Published Jan 1, 2004• 1 citation
OpenAlex

Related papers

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

On the block error probability of iteratively decoded LDPC codes

Michael Lentmaier, Dmitri V. Truhachev, Daniel J. Costello +1 more

•Jan 1, 2004•5 citations

The Decoding Algorithms For Error-Correcting Product Codes Based On Project Geometry Low-Density Parity-Check Codes

Л. Е. Назаров

The focus of this paper is directed towards the investigation of the characteristics of symbol-by-symbol iterative decoding algorithms for error-correcting block product-codes (block turbo-codes) which enable to reliable information transfer at relatively low received signal/noise and provide high power efficiency. Specific feature of investigated product codes is construction with usage of low-density parity-check codes (LDPC) and these code constructions are in the class of LDPC too. According to this fact the considered code constructions have symbol-by-symbol decoding algorithms developed for total class LDPC codes, namely BP (belief propagation) and its modification MIN_SUM_BP. The BP decoding algorithm is iterative and for implementation the signal/noise is required, for implementation of MIN_SUM_BP decoding algorithm the signal/noise is not required. The resulted characteristics of product codes constructed with usage of LDPC based on project geometry (length of code words, information volume, code rate, error performances) are presented in this paper. These component LDPC codes are cyclic and have encoding and decoding algorithms with low complexity implementation. The computer simulations for encoding and iterative symbol-by-symbol decoding algorithms for the number of turbo-codes with different code rate and information volumes are performed. The results of computer simulations have shown that MIN_SUM_BP decoding algorithm is more effective than BP decoding algorithm for channel with additive white gaussian noise concerning error-performances.

Radioelectronics Nanosystems Information Technologies•Oct 30, 2020•0 citations

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

Analysis and improvement of the bit-flipping decoding algorithm for LDPC codes

SU Guang-chuan

According to the statistical decoding method,a new enlarged set of the low density check vectors was constructed by the linear combination among the vectors of the LDPC code's old check matrix.Combined with the analysis of the ParallelBit-Flipping(PBF) decoding algorithm,such as loop detection technique,a new hard-decision decoding algorithm was presented for LDPC codes.The simulation results show that our algorithm has small iterative numbers just like the PBF algorithm,and the decoding performance approaching the belief propagation algorithm.

Journal of Computer Applications•Jan 1, 2006•0 citations

The Application of Asymptotic Enumeration to the Analysis of LDPC Codes

David Burshtein, Gadi Miller

•Oct 2, 2002•0 citations
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.
The focus of this paper is directed towards the investigation of the characteristics of symbol-by-symbol iterative decoding algorithms for error-correcting block product-codes (block turbo-codes) which enable to reliable information transfer at relatively low received signal/noise and provide high power efficiency. Specific feature of investigated product codes is construction with usage of low-density parity-check codes (LDPC) and these code constructions are in the class of LDPC too. According to this fact the considered code constructions have symbol-by-symbol decoding algorithms developed for total class LDPC codes, namely BP (belief propagation) and its modification MIN_SUM_BP. The BP decoding algorithm is iterative and for implementation the signal/noise is required, for implementation of MIN_SUM_BP decoding algorithm the signal/noise is not required. The resulted characteristics of product codes constructed with usage of LDPC based on project geometry (length of code words, information volume, code rate, error performances) are presented in this paper. These component LDPC codes are cyclic and have encoding and decoding algorithms with low complexity implementation. The computer simulations for encoding and iterative symbol-by-symbol decoding algorithms for the number of turbo-codes with different code rate and information volumes are performed. The results of computer simulations have shown that MIN_SUM_BP decoding algorithm is more effective than BP decoding algorithm for channel with additive white gaussian noise concerning error-performances.
According to the statistical decoding method,a new enlarged set of the low density check vectors was constructed by the linear combination among the vectors of the LDPC code's old check matrix.Combined with the analysis of the ParallelBit-Flipping(PBF) decoding algorithm,such as loop detection technique,a new hard-decision decoding algorithm was presented for LDPC codes.The simulation results show that our algorithm has small iterative numbers just like the PBF algorithm,and the decoding performance approaching the belief propagation algorithm.