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

Wiley eBooks

Non‐Binary Low‐Density Parity Check Codes

Rolando Antonio Carrasco, Martin Johnston

Published Nov 28, 2008• 2 citations
Publisher

Abstract

This chapter contains sections titled: Introduction Construction of Binary LDPC Codes – Random and Structured Methods Decoding of Binary LDPC Codes Using the Belief Propagation Algorithm Construction of Non-Binary LDPC Codes Defined Over Finite Fields Decoding Non-Binary LDPC Codes with the Sum–Product Algorithm Conclusions References

DOI
10.1002/9780470740415.ch6

Related papers

Low-Density Parity-Check Codes

Low Density Parity Check(LDPC) codes is one of the high topics of the channel coding theory and has been paid more and more attention.This paper begins with a brief review of channel coding theories.Then the iterative decoding algorithm of LDPC codes,so-called as Sum-Product algorithm or Belief Propagation algorithm,is represented in detail.And the construction of LDPC codes by means of random bipartite graph and algebraic constructions,and the performance analysis by Density Evolution theory,Gaussian Approximation method and Extrinsic Information Transfer(EXIT) charts etc.,are respectively discussed.Finally,the latest study results of LDPC codes are presented and some open questions about LDPC codes are provided.

Kluwer Academic Publishers eBooks•Dec 21, 2005•9 citations

Low-density parity-check codes

Sarah J. Johnson

Introduction In this chapter we introduce low-density parity-check (LDPC) codes, a class of error correction codes proposed by Gallager in his 1962 PhD thesis 12 years after error correction codes were first introduced by Hamming (published in 1950). Both Hamming codes and LDPC codes are block codes: the messages are broken up into blocks to be encoded at the transmitter and similarly decoded as separate blocks at the receiver. While Hamming codes are short and very structured with a known, fixed, error correction ability, LDPC codes are the opposite, usually long and often constructed pseudo-randomly with only a probabilistic notion of their expected error correction performance. The chapter begins by presenting parity bits as a means to detect and, when more than one is employed, to correct errors in digital data. Block error correction codes are described as a linear combination of parity-check equations and thus defined by their parity-check matrix representation. The graphical representation of codes by Tanner graphs is presented and the necessary graph theoretic concepts introduced. In Section 2.4 iterative decoding algorithms are introduced using a hard decision algorithm (bit flipping), so that the topic is developed first without reference to probability theory. Subsequently the sum–product decoding algorithm is presented. This chapter serves as a self-contained introduction to LDPC codes and their decoding. It is intended that the material presented here will enable the reader to implement LDPC encoders and iterative decoders.

Cambridge University Press eBooks•Nov 19, 2009•6 citations

Non-binary LDPC decoder architectures

Zhang Xinmiao

This chapter reviews nonbinary low–density parity–check (NB–LDPC) decoder architectures, with emphasis given to algorithmic and architectural modification techniques for the check node units. The belief propagation (BP) for binary low-density parity-check decoding can be extended to decode NB–LDPC codes. In non–binary BP, the check node processing also computes sums of products of probabilities. The computations in non–binary check node processing can be considered as convolutions of the incoming messages. Multiplications in probability domain are implemented as additions in log domain. The most prominent ones are the extended Minsum algorithm and the Min–max algorithm. Both of them are log-domain algorithms. The approximations lead to slight performance loss compared to the BP, the hardware complexity has been greatly reduced in these algorithms, and only additions on the reliability messages are involved in their check node processing. The number of multiplications in the check node processing is reduced in the frequency–domain approach.

CRC Press eBooks•Jun 29, 2015•0 citations

Decoding of LDPC Codes

Grigory A. Kabatiansky, Evgenii A. Krouk, Sergei Semenov

This chapter contains sections titled: Low-Density Parity-Check Codes LDPC Constructions Estimating the Minimum Distance of EG-LDPC Codes Burst-Error-Correcting LDPC Codes Decoding Schemes of LDPC Codes Simulation Results in AWGN Appendix 5.A Euclidean Geometries

Wiley eBooks•Feb 4, 2005•2 citations

Extended construction of array‐based non‐binary LDPC codes

Shancheng Zhao, Xiao Ma

Array‐based non‐binary (NB) low‐density parity‐check (LDPC) codes are attractive in practice for their advantages in implementation and performance. However, existing construction of array‐based NB LDPC codes is only with the prime number cases. In this Letter, the authors extend the array‐based construction to composite numbers to give an explicit construction of structured array‐based NB LDPC codes with column weights three, four, and five. The resulting codes have girth at least six. The simulation results show that the proposed structured codes perform as well as the random codes constructed by progressive edge‐growth algorithm, when decoded with the Q‐ary sum product algorithm and the low‐complexity weighted bit‐reliability‐based decoding algorithm.

Electronics Letters•Jan 9, 2019•7 citations

Study on Decoding Algorithm for Non-Binary LDPC Codes

Lei Wen

Non-binary LDPC codes are obtained by generalizing binary LDPC coeds from finite field GF(2) to finite field GF(q).Its elements of parity check matrix are not(0,1),but ensemble(0,1,…,q-1),and its decoding method still employs belief propagation and iterative algorithm.This paper mainly derives the iterative formulas of decoding algorithm for Non-Binary LDPC codes and analyzes an improved algorithm based on FFT.Finally,the predominant performance of FFT decoding algorithm is verified by simulation.

Communications technology•Jan 1, 2011•0 citations
This chapter contains sections titled: Introduction Construction of Binary LDPC Codes – Random and Structured Methods Decoding of Binary LDPC Codes Using the Belief Propagation Algorithm Construction of Non-Binary LDPC Codes Defined Over Finite Fields Decoding Non-Binary LDPC Codes with the Sum–Product Algorithm Conclusions References
Low Density Parity Check(LDPC) codes is one of the high topics of the channel coding theory and has been paid more and more attention.This paper begins with a brief review of channel coding theories.Then the iterative decoding algorithm of LDPC codes,so-called as Sum-Product algorithm or Belief Propagation algorithm,is represented in detail.And the construction of LDPC codes by means of random bipartite graph and algebraic constructions,and the performance analysis by Density Evolution theory,Gaussian Approximation method and Extrinsic Information Transfer(EXIT) charts etc.,are respectively discussed.Finally,the latest study results of LDPC codes are presented and some open questions about LDPC codes are provided.
Introduction In this chapter we introduce low-density parity-check (LDPC) codes, a class of error correction codes proposed by Gallager in his 1962 PhD thesis 12 years after error correction codes were first introduced by Hamming (published in 1950). Both Hamming codes and LDPC codes are block codes: the messages are broken up into blocks to be encoded at the transmitter and similarly decoded as separate blocks at the receiver. While Hamming codes are short and very structured with a known, fixed, error correction ability, LDPC codes are the opposite, usually long and often constructed pseudo-randomly with only a probabilistic notion of their expected error correction performance. The chapter begins by presenting parity bits as a means to detect and, when more than one is employed, to correct errors in digital data. Block error correction codes are described as a linear combination of parity-check equations and thus defined by their parity-check matrix representation. The graphical representation of codes by Tanner graphs is presented and the necessary graph theoretic concepts introduced. In Section 2.4 iterative decoding algorithms are introduced using a hard decision algorithm (bit flipping), so that the topic is developed first without reference to probability theory. Subsequently the sum–product decoding algorithm is presented. This chapter serves as a self-contained introduction to LDPC codes and their decoding. It is intended that the material presented here will enable the reader to implement LDPC encoders and iterative decoders.
This chapter reviews nonbinary low–density parity–check (NB–LDPC) decoder architectures, with emphasis given to algorithmic and architectural modification techniques for the check node units. The belief propagation (BP) for binary low-density parity-check decoding can be extended to decode NB–LDPC codes. In non–binary BP, the check node processing also computes sums of products of probabilities. The computations in non–binary check node processing can be considered as convolutions of the incoming messages. Multiplications in probability domain are implemented as additions in log domain. The most prominent ones are the extended Minsum algorithm and the Min–max algorithm. Both of them are log-domain algorithms. The approximations lead to slight performance loss compared to the BP, the hardware complexity has been greatly reduced in these algorithms, and only additions on the reliability messages are involved in their check node processing. The number of multiplications in the check node processing is reduced in the frequency–domain approach.
Array‐based non‐binary (NB) low‐density parity‐check (LDPC) codes are attractive in practice for their advantages in implementation and performance. However, existing construction of array‐based NB LDPC codes is only with the prime number cases. In this Letter, the authors extend the array‐based construction to composite numbers to give an explicit construction of structured array‐based NB LDPC codes with column weights three, four, and five. The resulting codes have girth at least six. The simulation results show that the proposed structured codes perform as well as the random codes constructed by progressive edge‐growth algorithm, when decoded with the Q‐ary sum product algorithm and the low‐complexity weighted bit‐reliability‐based decoding algorithm.
Non-binary LDPC codes are obtained by generalizing binary LDPC coeds from finite field GF(2) to finite field GF(q).Its elements of parity check matrix are not(0,1),but ensemble(0,1,…,q-1),and its decoding method still employs belief propagation and iterative algorithm.This paper mainly derives the iterative formulas of decoding algorithm for Non-Binary LDPC codes and analyzes an improved algorithm based on FFT.Finally,the predominant performance of FFT decoding algorithm is verified by simulation.