Low Density Parity Check 1

Low Density Parity Check Code

Noof Ebrahim Sara Alblooshi Esraa Alawadi

Electrical and Electronic Engineering Electrical and Electronic Engineering Electrical and Electronic Engineering
Department Department Department
University of Sharjah University of Sharjah University of Sharjah
U18102234 U18105697 U19101569

Fatima Alnaqbi Ameenah Y A E

Electrical and Electronic Engineering Department Electrical and Electronic Engineering Department
University of Sharjah University of Sharjah
U19101123 U19104397

Abstract- This paper explores the use of Low-

Density Parity-Check (LDPC) codes in
modern communication systems. The research
question addressed is whether LDPC codes
can provide better performance than other
error-correcting codes, such as Turbo codes.
The paper describes the methods used to
evaluate the performance of LDPC codes,
including simulations and experiments.

I. INTRODUCTION

Low-density parity-check (LDPC) codes are a class of

error-correcting codes that have been gaining significant
attention in recent years due to their impressive
performance in various applications, such as wireless
communication, optical communication, and storage
systems. Bazzi and Kim (2017) evaluated the performance Figure 1 Matrix representation and Tanner graph representation
of LDPC codes in different communication channels and
found that they offer significant advantages over other
error-correcting codes. LDPC codes are linear block codes
that utilize sparse parity- check matrices, resulting in high
coding gain and low error rates. Gallager (1963) was one
of the pioneers of LDPC codes, and his work laid the
foundation for modern research in this area.
 Low Density Parity Check
LDPC codes are constructed using a parity- check
matrix with a low density of ones, resulting in a sparse
matrix that can be efficiently encoded and decoded.
The decoding process of LDPC codes can be
performed using iterative message-passing algorithms
such as belief propagation (BP) or sum-product
algorithm (SPA).
Figure 2 Relation between BER and SNR
The performance of LDPC codes can be improved by
optimizing the parity-check matrix and selecting an
appropriate decoding algorithm. Richardson and
Urbanke (2001) demonstrated that LDPC codes have
the capacity to achieve near-Shannon limit
performance under message-passing decoding.
Moreover, various LDPC code constructions have
been proposed, including regular and irregular LDPC
codes, structured and unstructured LDPC codes, and
LDPC codes based on finite geometries.
In this project, we will explore the design and
implementation of LDPC codes and evaluate their
performance in different communication scenarios.
We will also investigate the impact of various factors
such as code rate, code length, and signal-to-noise
ratio (SNR) on the performance of LDPC codes.
Overall, this project aims to provide a comprehensive
understanding of LDPC codes and their potential
applications in various communication systems. The
results of this project can be used to optimize the
design and implementation of LDPC codes
2
for practical use in real-world communication
systems.
II. PROGRESS SUMMARY
Since the start of the LDPC codes project, we have
made significant progress towards achieving the
project goals. Our focus has been on investigating
LDPC codes, exploring their design and
implementation, and evaluating their performance in
various communication scenarios.The project on
investigating LDPC codes and their performance
characteristics in different communication scenarios
has made significant progress in the last few weeks.
The following is a detailed progress summary of the
project
III. LITERATURE REVIEW:
The initial phase of the project involved an extensive
literature review on LDPC codes, including their
history, theory, design, and applications. This
literature review helped us to gain a better
understanding of the topic and identify the research
gaps that need to be addressed in this project.
Low-Density Parity-Check (LDPC) codes are a class
of error-correcting codes that have gained significant
attention in recent years due to their impressive
performance in various communication applications,
including wireless communication, optical
communication, and storage systems. In this literature
review, we will investigate the state of the art of
LDPC codes, including their design and
implementation, decoding algorithms, and
performance evaluation.
LDPC codes were first proposed by Gallager in 1963,
but their full potential was not realized until the
1990s when iterative decoding algorithms, such as
the belief propagation algorithm, were developed.
Since then, LDPC codes have become a popular
choice for error-correction in vario
 Low Density Parity Check
communication systems due to their high coding gain
and low error rates.
LDPC codes are linear block codes that utilize sparse
parity-check matrices. The fundamental idea behind
LDPC codes is to construct a parity-check matrix
with a low density of ones, resulting in a sparse
matrix that can be efficiently encoded and decoded.
The decoding process of LDPC codes can be
performed using iterative message-passing algorithms
such as belief propagation (BP) or sum-product
algorithm (SPA).
Over the years, various techniques have been
proposed to design LDPC codes with better
performance. One popular approach is to use
irregular LDPC codes, which have varying numbers
of ones in each row and column of the parity-check
matrix. Irregular LDPC codes have been shown to
outperform regular LDPC codes for high-rate
applications. Another approach is to use LDPC codes
based on finite geometries, such as projective planes
and generalized polygons, which have been shown to
achieve near-optimal performance.
Several studies have focused on the performance
evaluation of LDPC codes in different
communication scenarios. For example, in a study by
Zhang et al. (2020), the authors evaluated the
performance of LDPC codes in multi-user
cooperative communication systems. They showed
that LDPC codes can achieve good performance even
in highly dynamic and noisy environments.
In recent years, deep learning has emerged as a
powerful tool for improving the performance of
LDPC codes. For example, in a study by Nachmani et
al. (2020), the authors proposed a deep neural
network architecture for decoding LDPC codes,
which achieved state-of-the-art performance on
various benchmark datasets.
3
LDPC codes have become a popular choice for error-
correction in various communication systems due to
their high coding gain and low error rates. Over the
years, various techniques have been proposed to
design LDPC codes with better performance, and
deep learning has emerged as a powerful tool for
improving the performance of LDPC codes. Future
research in this area should focus on developing more
efficient encoding and decoding algorithms for LDPC
codes, and investigating their practical applications in
real-world communication systems.
In a paper by Yuan et al. (2021), a new class of
LDPC codes with a rate of 0.5 and block length of
2048 was proposed. The code design used a
construction method that achieved a trade-off
between the code rate, minimum distance, and
decoding complexity. Simulation results showed that
the proposed codes outperformed existing codes in
terms of the bit error rate (BER) for different channel
models, while maintaining low decoding complexity.
A. LDPC Code Construction:
LDPC codes are a class of linear codes with sparse
parity-check matrices that have been widely studied
in the past two decades. Their sparse structure makes
them attractive for practical applications, since
decoding can be performed using low-complexity
iterative algorithms. [1]
Figure 3 Shortening process at the transmitter
LDPC codes can achieve performance close to the
Shannon limit, making them attractive
Low Density Parity Check
for high-speed communication systems. This is due to
their sparse parity-check matrix, which allows for
efficient decoding algorithms [2]
B. Encoding and Decoding:
The encoding process of an LDPC code involves
multiplying the message vector by a sparse generator
matrix. The generator matrix is constructed from the
parity-check matrix using a systematic construction,
which ensures that the original message can be
recovered from the codeword [2].
Figure 4
Encoding
Belief propagation is the most widely used algorithm
for decoding LDPC codes due to its low complexity
and good performance. However, it can suffer from
error floors in some cases, which has motivated
research into new decoding algorithms and code
designs [3]. The decoding performance was evaluated
by measuring the bit error rate (BER) and frame error
rate (FER) of the decoded messages. The decoding
algorithm was optimized by adjusting the number of
iterations.
C. Performance Evaluation:
We evaluated the performance of LDPC codes in
different communication scenarios, including
additive white Gaussian noise (AWGN) channel and
Rayleigh fading channel. The results showed that
LDPC codes outperform other error-correcting codes
such as convolutional codes and turbo codes in terms
of BER and FER.
4
The performance of LDPC codes is typically
evaluated using the bit error rate (BER) or frame
error rate (FER) as a function of the signal-to-noise
ratio (SNR). The BER or FER is the probability that a
bit or frame is decoded incorrectly [4].
Here are some common performance metrics used to
evaluate the performance of LDPC codes:
1. Bit Error Rate (BER): BER is the probability
that a bit is decoded incorrectly. Lower BER
values indicate better performance.
2. Frame Error Rate (FER): FER is the probability
that a frame (a group of bits) is decoded
incorrectly. Lower FER values indicate better
performance.
3. Signal-to-Noise Ratio (SNR): SNR is the ratio
of the power of the received signal to the power
of the noise. Higher SNR value indicates better
performance.
4. Iterations: Iterations are the number of decoding
iterations required to achieve a certain BER or
FER. Lower numbers of iterations indicate
better performance.
5. Decoding Complexity: Decoding complexity is
the computational complexity required to
decode the LDPC code. Lower decoding
complexity values indicate better performance.
These metrics can be used to evaluate the
performance of LDPC codes in different
communication systems and channel conditions.
D. Comparison:
We compared the performance of LDPC codes with
other error-correcting codes such as convolutional
codes and turbo codes in various communication
scenarios. LDPC codes have been shown to
outperform many
Low Density Parity Check
other types of error-correcting codes, such as turbo
codes and convolutional codes, in a variety of
communication systems [5].
The performance of LDPC codes can be improved by
combining them with other coding schemes, such as
turbo codes or product codes, to create hybrid codes
[4]
E. Analysis of Factors:
We analyzed the impact of various factors such as
code rate, code length, and signal-to- noise ratio
(SNR) on the performance of LDPC codes. The
results showed that increasing the code length and
decreasing the code rate can improve the
performance of LDPC codes.
In summary, the project has made significant
progress in investigating LDPC codes and their
performance characteristics in different
communication scenarios. Overall, we have made
significant progress towards achieving the project
goals. Our results show that LDPC codes have
excellent performance characteristics and have the
potential to be used in various communication
systems. Our next steps will involve further
optimization and evaluation of LDPC codes to
enhance their performance and explore their practical
applications.
IV. RESEARCH GAP
Design of LDPC codes for specific applications:
While LDPC codes are known to perform well in a
variety of communication systems, there is still room
for optimization and customization of LDPC codes
for specific applications. For example, LDPC codes
could be designed specifically for use in IoT devices,
which have unique requirements for low power
consumption and robustness in noisy environments.
Hardware implementations of LDPC decoders: While
LDPC decoding algorithms
5
are relatively simple, they can still be
computationally intensive. There is a need for
efficient hardware implementations of LDPC
decoders to enable high-speed communication
systems. This includes research on new architectures
for LDPC decoders, as well as optimization of
existing implementations.
Analysis of LDPC codes under different channel
models: LDPC codes have been extensively studied
under the binary symmetric channel (BSC) and
additive white Gaussian noise (AWGN) channel
models. However, there is a need for further analysis
of LDPC codes under other channel models, such as
fading channels, bursty channels, and non-Gaussian
noise channels.
Development of joint coding and modulation
schemes: LDPC codes are often used in combination
with QAM or PSK modulation schemes. However,
there is a need for research on joint coding and
modulation schemes that can further improve the
performance of LDPC codes in communication
systems.
V. FUTURE WORK
Moving forward, our plans for the LDPC codes
project involve further optimization and evaluation of
LDPC codes to enhance their performance and
explore their practical applications. Specifically, we
plan to:
A. Optimize the design of LDPC codes:
We will explore different LDPC code constructions
and investigate their impact on the performance of
LDPC codes. We will also investigate the impact of
different LDPC code parameters such as code length,
code rate, and check node degree on the performance
of LDPC codes.
Low Density Parity Check 6

B. LDPC codes in different communication VI. RESULTS

systems:
We will investigate the use of LDPC codes in various
communication systems such as wireless
communication, optical
communication, and storage systems.
C. Hardware-based LDPC decoders:
We plan to implement LDPC decoders using
hardware to achieve high-throughput decoding and
low power consumption. We will explore different
hardware platforms such as FPGAs and ASICs.
D. Compare LDPC codes with other error-
correcting codes:
We will compare the performance of LDPC codes
with other error-correcting codes such as Turbo codes
and polar codes to identify the strengths and
weaknesses of each code and determine which is best
suited for specific applications.
Overall, our future plans aim to further enhance our
understanding of LDPC codes, optimize their design,
and evaluate their performance in various
communication scenarios. Our results will provide
valuable insights into the practical applications of
LDPC codes and their potential to improve the
reliability and efficiency of communication systems.
Low Density Parity Check 7

implementation, and their performance characteristics

in different communication scenarios. The review has
also highlighted the importance of optimizing the
parity- check matrix and selecting an appropriate
decoding algorithm to improve the performance of
LDPC codes.

Recent research has focused on developing advanced

LDPC code constructions and decoding algorithms,
as well as applying LDPC codes in emerging
technologies such as 5G wireless communication and
quantum communication. Future research directions
include exploring the potential of LDPC codes in
machine learning and artificial intelligence systems,
as well as investigating the impact of LDPC codes in
the context of the Internet of Things (IoT) and smart
grid applications.

References

[1] Ido Tal & Alexander Vardy, “List Decoding of

Polar Codes” arXiv:1206.0050v1 [cs.IT] 2012

[2] Chi Kien Nguyen, “Low-Density Parity- Check

Codes Construction and Performance
Evaluation” 2002

[3] Chi Kien Nguyen, “Low-Density Parity- Check

Codes Construction and Performance
Evaluation” 2002
[4] Gallager, R. (1962). Low-density parity- check
codes. IRE Transactions on information theory,
8(1), 21-28.
VII. CONCLUSION: [5] P. Elias, “Coding for two noisy channels,” in
Information Theory, Third London Symposium,
In conclusion, Low-Density Parity-Check (LDPC) pp. 61–76, 1955.
codes are a powerful class of error- correcting codes
that have been widely used in various communication [6] Johnson, S. J. (2006). Introducing low- density
systems. LDPC codes offer high coding gain and low parity-check codes. University of Newcastle,
error rates, making them an attractive option for Australia, 1, 2006.
applications such as wireless communication, optical
communication, and storage systems.

This literature review has provided an overview of

the fundamental principles of LDPC codes,
their design and
Low Density Parity Check 8