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

Beijing Youdian Xueyuan xuebao

Performance of Nonbinary LDPC Codes over Noise Burst Channels

Bing Liu

Published Jan 1, 2011• 0 citations
OpenAlex

Abstract

The performances of nonbinary low-density parity-check(LDPC) codes are studied and simulated on the presented noise burst channel model.Compared to binary LDPC codes,the nonbinary LDPC codes have a better anti-burst-error performance.The reason is given by analyzing the process of decoding.The transformation between binary soft information and nonbinary initial soft information is also presented.Simulations show that nonbinary LDPC codes have advantages of error performance and iterative characteristics with different parameters for noise burst channels.

Related papers

E-IHRB Decoder Architectures for Non-Binary LDPC Codes

Madamsetti, Kalyani, M, Suseela

In the information theory , the non- binary low density parity check  (NB-LDPC) code is a  linear error correcting code , a method of transmitting message over a  noisy transmission channel. LDPCcodes are  capacity-approaching codes , which  means  that  practical constructions exist  that allow the noise threshold to be set very close to the theoretical maximum for a symmetric memory less channel.Using iterative  belief propagation techniques, NB-LDPC codes can be decoded in time linear to their block length. Non-binary low-density parity-check codes can achieve higher performance than their binary counterparts. Recently, two algorithms were developed for decoding NB-LDPC codes: iterative hard reliability-based majority-logic decoding (IHRB-MLGD) and iterative soft reliability-based majority-logic decoding (ISRB-MLGD has better performance-complexity tradeoffs than previous algorithms. This paper first proposes message-passing in such a way that we can reduce the memory consumption to a greater extent at the same time there should not be performance loss. By using enhanced iterative reliability-based majority-logic decoding algorithms we can achieve effective complexity-performance and noise free design. Compared to previous designs, our proposed decoders have at least tens of times lower complexity with moderate coding gain loss.

•Aug 31, 2014•0 citations

EXIT charts for nonbinary LDPC codes

Yong Li

Non-binary low-density parity-check(LDPC) codes defined over the finite field GF(q=2p) are an extension of binary LDPC codes and have demonstrated improved performance over binary LDPC codes with the same frame length and rate.This paper introduces the principle of extrinsic information transfer(EXIT) charts,analyzes the convergence behavior of non-binary LDPC codes on AWGN channel,and confirms the thresholds of non-binary LDPC codes,which provides the foundation for analysis and design of real communication system using EXIT tool in future work.Simulation result shows that the performance of quaternary LDPC codes is better than that of binary LDPC codes in the same channel,and validates the superiority of using EXIT chart for iterative research.

Journal of Chongqing University of Posts and Telecommunications•Jan 1, 2008•0 citations

Performance Comparison of Eg-Ldpc Codes With Maximum Likelihood Algorithm Over Non-Binary Ldpc Codes

M. Sakthivel, M. Karthick Raja, KR.Ragupathy +1 more

Error correcting coding has become one essential part in nearly all the modern data transmission and storage systems.Low density parity check (LDPC) codes are a class of linear block code has the superior performance closer to the Shannon's limit.In this paper two error correcting codes from the family of LDPC codes specifically Euclidean Geometry Low Density Parity Check (EG-LDPC) codes and Nonbinary low density parity check (NB-LDPC) codes are compared in terms of power consumption, number of iterations and other parameters.For better performance of EG-LDPC codes, Maximum Likelihood (ML) Algorithm was proposed.NB-LDPC codes can provide better error correcting performance with an average of 10 to 30 iterations but has high decoding complexity which can be improve by EG-LDPC codes with ML algorithm having only three iterations for detecting and correcting errors.One step majority logic decodable (MLD) codes is a subclass of EG-LDPC codes are used to avoid high decoding complexity.The power Consumed by NB-LDPC codes is 2.729W whereas the power consumed by EG-LDPC codes with ML algorithm is 1.148W.

International Journal of Computational Science and Information Technology•May 30, 2014•1 citation

Modification Methods for Construction and Performance Analysis of Low-Density Parity-Check Codes over the Markov-Modulated Channels

Gou Hosoya, Hideki Yagi, Shigeichi Hirasawa

We derive burst error correctable length of the lowdensity parity-check (LDPC) codes by the iterative decoding algorithms. By results of simulation, we show that the decoding performance of iterative decoding algorithms for the LDPC codes over the Markovmodulated binary symmetric channels (MM-BSC) are aected by the distance between elements (DBE). We also show that some column permuted LDPC codes that have larger DBE, have robustness in error performance over the MM-BSC, compared to the original LDPC codes.

•Jan 1, 2004•4 citations

An analytical approach to the performance of Low Density Parity Check Codes

R. Lakshmi, Tilty Tony, Abin Johns Raju

Low Density Parity Check Codes (LDPC) is a class of linear block codes best suited for forward error control in communication systems. When compared with other codes, LDPC codes have significant performance gain, which can be turned to an increase of the coverage range or a reduction of transmission power. Hence a convenient and practical receiver is obtained. The analysis done in this paper is based on the Bit Error Rate of the decoded output. The factors considered for the analysis are multiple code rate, different number of iterations and various decoding schemes. For lower code rate, soft decision decoding and increased number of iterations LDPC codes yields a better performance.

International Conference on Advanced Computing and Communication Systems (ICACCS)•Dec 1, 2013•5 citations

A stopping criterion for nonbinary LDPC codes over GF(q)

Xin Chen, Aidong Men, Wei Zhou

Nonbinary low-density parity-check (LDPC) codes over finite fields GF(q) have a better performance than those of the binary low-density parity-check codes, at short and medium block lengths, but the decoder of GF(q)-LDPC has more complexity. In this paper, a new stopping criterion is proposed. Based on the changes of the variance of variable node¿s extrinsic information, the criterion can predict a decoding failure and decide whether the iteration of the decoder should be stopped. The simulation results show that the stopping criterion can greatly reduces the average number of required iterations of GF(q)-LDPC decoder with negligible performance loss.

IEEE International Conference on Communication Systems (ICCS)•Nov 1, 2008•4 citations
The performances of nonbinary low-density parity-check(LDPC) codes are studied and simulated on the presented noise burst channel model.Compared to binary LDPC codes,the nonbinary LDPC codes have a better anti-burst-error performance.The reason is given by analyzing the process of decoding.The transformation between binary soft information and nonbinary initial soft information is also presented.Simulations show that nonbinary LDPC codes have advantages of error performance and iterative characteristics with different parameters for noise burst channels.
In the information theory , the non- binary low density parity check  (NB-LDPC) code is a  linear error correcting code , a method of transmitting message over a  noisy transmission channel. LDPCcodes are  capacity-approaching codes , which  means  that  practical constructions exist  that allow the noise threshold to be set very close to the theoretical maximum for a symmetric memory less channel.Using iterative  belief propagation techniques, NB-LDPC codes can be decoded in time linear to their block length. Non-binary low-density parity-check codes can achieve higher performance than their binary counterparts. Recently, two algorithms were developed for decoding NB-LDPC codes: iterative hard reliability-based majority-logic decoding (IHRB-MLGD) and iterative soft reliability-based majority-logic decoding (ISRB-MLGD has better performance-complexity tradeoffs than previous algorithms. This paper first proposes message-passing in such a way that we can reduce the memory consumption to a greater extent at the same time there should not be performance loss. By using enhanced iterative reliability-based majority-logic decoding algorithms we can achieve effective complexity-performance and noise free design. Compared to previous designs, our proposed decoders have at least tens of times lower complexity with moderate coding gain loss.
Non-binary low-density parity-check(LDPC) codes defined over the finite field GF(q=2p) are an extension of binary LDPC codes and have demonstrated improved performance over binary LDPC codes with the same frame length and rate.This paper introduces the principle of extrinsic information transfer(EXIT) charts,analyzes the convergence behavior of non-binary LDPC codes on AWGN channel,and confirms the thresholds of non-binary LDPC codes,which provides the foundation for analysis and design of real communication system using EXIT tool in future work.Simulation result shows that the performance of quaternary LDPC codes is better than that of binary LDPC codes in the same channel,and validates the superiority of using EXIT chart for iterative research.
Error correcting coding has become one essential part in nearly all the modern data transmission and storage systems.Low density parity check (LDPC) codes are a class of linear block code has the superior performance closer to the Shannon's limit.In this paper two error correcting codes from the family of LDPC codes specifically Euclidean Geometry Low Density Parity Check (EG-LDPC) codes and Nonbinary low density parity check (NB-LDPC) codes are compared in terms of power consumption, number of iterations and other parameters.For better performance of EG-LDPC codes, Maximum Likelihood (ML) Algorithm was proposed.NB-LDPC codes can provide better error correcting performance with an average of 10 to 30 iterations but has high decoding complexity which can be improve by EG-LDPC codes with ML algorithm having only three iterations for detecting and correcting errors.One step majority logic decodable (MLD) codes is a subclass of EG-LDPC codes are used to avoid high decoding complexity.The power Consumed by NB-LDPC codes is 2.729W whereas the power consumed by EG-LDPC codes with ML algorithm is 1.148W.
We derive burst error correctable length of the lowdensity parity-check (LDPC) codes by the iterative decoding algorithms. By results of simulation, we show that the decoding performance of iterative decoding algorithms for the LDPC codes over the Markovmodulated binary symmetric channels (MM-BSC) are aected by the distance between elements (DBE). We also show that some column permuted LDPC codes that have larger DBE, have robustness in error performance over the MM-BSC, compared to the original LDPC codes.
Low Density Parity Check Codes (LDPC) is a class of linear block codes best suited for forward error control in communication systems. When compared with other codes, LDPC codes have significant performance gain, which can be turned to an increase of the coverage range or a reduction of transmission power. Hence a convenient and practical receiver is obtained. The analysis done in this paper is based on the Bit Error Rate of the decoded output. The factors considered for the analysis are multiple code rate, different number of iterations and various decoding schemes. For lower code rate, soft decision decoding and increased number of iterations LDPC codes yields a better performance.
Nonbinary low-density parity-check (LDPC) codes over finite fields GF(q) have a better performance than those of the binary low-density parity-check codes, at short and medium block lengths, but the decoder of GF(q)-LDPC has more complexity. In this paper, a new stopping criterion is proposed. Based on the changes of the variance of variable node¿s extrinsic information, the criterion can predict a decoding failure and decide whether the iteration of the decoder should be stopped. The simulation results show that the stopping criterion can greatly reduces the average number of required iterations of GF(q)-LDPC decoder with negligible performance loss.