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

Applied Mechanics and Materials

An Improved Construction for Yielding Nonbinary LDPC Codes

Li Sheng Zhang, Zhipeng Huang, Fanxin Zeng

Published May 1, 2014• 0 citations
Publisher

Abstract

In this paper, we investigate construction methods for producing nonbinary LDPC codes, and a family of nonbinary LDPC codes over is presented and its properties are derived. Compared to the second method presented by Ref. [5], simulation results show that the proposed LDPC codes perform well over the AWGN channel under belief propagation decoding algorithm and have an almost same BER curve as the ones in Ref. [5]. However, the resultant construction method is simpler than the latter’s.

DOI
10.4028/www.scientific.net/amm.556-562.6307

Related papers

A novel family of nonbinary LDPC codes over finite fields

Lisheng Zhang, Fanxin Zeng, Lirui Tan

In this paper, a family of nonbinary LDPC codes over a finite field GF(q) is presented and its properties are derived. In comparison with the second method presented by Ref. [4], the simulation results show that in 16-ary (75,150), 64-ary (441,882) and 128-ary (1270,2540) LDPC code, the proposed LDPC codes have a slight higher coding gain, 0.25dB, 0.2dB, and 0.15 dB at the BER= 10-4, respectively, which demonstrates that the proposed nonbinary LDPC codes are valid.

International Conference on Information Science and Control Engineering•Jan 1, 2012•0 citations

A unified approach to the construction of binary and nonbinary quasi-cyclic LDPC codes based on finite fields

Shumei Song, Bo Zhou, Shu Hwa Lin +1 more

A unified approach for constructing binary and nonbinary quasi-cyclic LDPC codes under a single framework is presented. Six classes of binary and nonbinary quasi-cyclic LDPC codes are constructed based on primitive elements, additive subgroups, and cyclic subgroups of finite fields. Numerical results show that the codes constructed perform well over the AWGN channel with iterative decoding.

IEEE Transactions on Communications•Jan 1, 2009•104 citations

Reed-Solomon based nonbinary LDPC codes

Juane Li, Keke Liu, Shu Lin +1 more

This paper is concerned with designs and constructions of nonbinary LDPC codes based on the conventional parity-check matrices of Reed-Solomon codes.

International Symposium on Information Theory and its Applications•Oct 1, 2016•1 citation

Design and Analysis of NB QC-LDPC Codes Over Small Alphabets

Irina E. Bocharova, Boris D. Kudryashov, Evgenii P. Ovsyannikov +2 more

We propose a novel approach to optimization of irregular nonbinary (NB) quasi-cyclic (QC)-LDPC codes over small alphabets. In this approach, first, the base parity-check matrices are constructed by a simulated annealing method, and then these matrices are labeled by the field elements while maximizing the so- called generalized girth of the Tanner graph. In order to analyze the performance of the constructed irregular NB LDPC codes, a new ensemble of irregular NB LDPC codes over the extensions of the binary Galois field is introduced. A finite-length random coding bound on the error probability of the maximum-likelihood (ML) decoding over the binary phase shift keying (BPSK) input AWGN channel for the new code ensemble is derived. The frame error rate (FER) performance of the sum-product belief-propagation (BP) decoding of the constructed NB QC-LDPC block codes is compared to that of both the optimized binary QC-LDPC block codes in the 5G standard and the best known NB QC-LDPC codes as well as to the derived random coding bound on the ML decoding error probability. It is shown that the obtained bound predicts the behavior of BP decoding performance of practical NB QC-LDPC codes more accurately than the BP decoding thresholds do.

IEEE Transactions on Communications•Mar 16, 2022•16 citations

BP-LED Decoding Algorithm for LDPC Codes Over AWGN Channels

Irina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek +1 more

A new method is presented for low-complexity near-maximum-likelihood (ML) decoding of low-density parity-check (LDPC) codes over the additive white Gaussian noise channel. The proposed method termed belief-propagation-list erasure decoding (BP-LED) is based on erasing carefully chosen unreliable bits performed in case of BP decoding failure. A strategy of introducing erasures into the received vector and a new erasure decoding algorithm are proposed. The new erasure decoding algorithm, called list erasure decoding, combines ML decoding over the BEC with list decoding applied if the ML decoder fails to find a unique solution. The asymptotic exponent of the average list size for random regular LDPC codes from the Gallager ensemble is analyzed. Furthermore, a few examples of irregular quasi-cyclic LDPC as well as randomly constructed regular LDPC codes of short and moderate lengths are studied by simulations and their performance is compared to the tightened upper bound on the LDPC ensemble-average performance and the upper bound on the average performance of random linear codes under ML decoding. A comparison of the BP decoding and BP-LED performance of the WiMAX standard codes and performance of the near-ML BEAST decoding are presented. The new algorithm is applied to decoding a short nonbinary (NB) LDPC code over extensions of the binary Galois field. The obtained simulation results are compared to the tightened upper bound on the ensemble-average performance of the binary image of regular NB LDPC codes.

arXiv:1705.09507•IEEE Transactions on Information Theory•Aug 24, 2018•15 citations

Hybrid Construction of LDPC Codes

Shu Lin, Jun Xu, Ivana Djurdjevic +1 more

This paper presents a hybrid method for constructing low density parity check (LDPC) codes.Several classes of hybrid LDPC codes have been constructed.A special case of the hybrid construction gives a class of product LDPC codes.

•Oct 2, 2002•0 citations
In this paper, we investigate construction methods for producing nonbinary LDPC codes, and a family of nonbinary LDPC codes over is presented and its properties are derived. Compared to the second method presented by Ref. [5], simulation results show that the proposed LDPC codes perform well over the AWGN channel under belief propagation decoding algorithm and have an almost same BER curve as the ones in Ref. [5]. However, the resultant construction method is simpler than the latter’s.
We propose a novel approach to optimization of irregular nonbinary (NB) quasi-cyclic (QC)-LDPC codes over small alphabets. In this approach, first, the base parity-check matrices are constructed by a simulated annealing method, and then these matrices are labeled by the field elements while maximizing the so- called generalized girth of the Tanner graph. In order to analyze the performance of the constructed irregular NB LDPC codes, a new ensemble of irregular NB LDPC codes over the extensions of the binary Galois field is introduced. A finite-length random coding bound on the error probability of the maximum-likelihood (ML) decoding over the binary phase shift keying (BPSK) input AWGN channel for the new code ensemble is derived. The frame error rate (FER) performance of the sum-product belief-propagation (BP) decoding of the constructed NB QC-LDPC block codes is compared to that of both the optimized binary QC-LDPC block codes in the 5G standard and the best known NB QC-LDPC codes as well as to the derived random coding bound on the ML decoding error probability. It is shown that the obtained bound predicts the behavior of BP decoding performance of practical NB QC-LDPC codes more accurately than the BP decoding thresholds do.
A new method is presented for low-complexity near-maximum-likelihood (ML) decoding of low-density parity-check (LDPC) codes over the additive white Gaussian noise channel. The proposed method termed belief-propagation-list erasure decoding (BP-LED) is based on erasing carefully chosen unreliable bits performed in case of BP decoding failure. A strategy of introducing erasures into the received vector and a new erasure decoding algorithm are proposed. The new erasure decoding algorithm, called list erasure decoding, combines ML decoding over the BEC with list decoding applied if the ML decoder fails to find a unique solution. The asymptotic exponent of the average list size for random regular LDPC codes from the Gallager ensemble is analyzed. Furthermore, a few examples of irregular quasi-cyclic LDPC as well as randomly constructed regular LDPC codes of short and moderate lengths are studied by simulations and their performance is compared to the tightened upper bound on the LDPC ensemble-average performance and the upper bound on the average performance of random linear codes under ML decoding. A comparison of the BP decoding and BP-LED performance of the WiMAX standard codes and performance of the near-ML BEAST decoding are presented. The new algorithm is applied to decoding a short nonbinary (NB) LDPC code over extensions of the binary Galois field. The obtained simulation results are compared to the tightened upper bound on the ensemble-average performance of the binary image of regular NB LDPC codes.