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

International journal of advance research and innovative ideas in education

Performance comparison of Decoding Algorithm for LDPC codes in DVBS2

Ronakben P Patel, Prof.Pooja Thakar

Published Jan 1, 2016• 1 citation
OpenAlex

Abstract

Low density parity check code being the most powerful Error correcting code with performance near to Shannon limit is studied and simulated in this paper. Because of its performance it is used in Digital Video Broadcasting Satellite for Second Generation (DVBS2).In this paper, LDPC encoding algorithm named “Irregular repeat accumulated code” has been illustrated in detail. There are several algorithms existing for the decoding of the LDPC decoder. Among them here, two decoding algorithm named “Turbo decoding message passing Algorithm” and “Two phase message passing algorithm” has been illustrated and simulated in MATLAB. The results comparing these two decoding algorithms and different iterations have been presented in this paper.

Related papers

Study on the decoding algorithm for LDPC based on DMB-TH

Guochun Wan, Yan-Fen Luo, Xun Liu +1 more

Terrestrial digital multimedia TV/handle broadcasting (DMB-TH) is a newly upcoming framing structure, channel coding and modulation for digital television terrestrial broadcasting system standard of China, which is recently drafted and is ready to be verified in order to deploy mobile multimedia broadcasting services for the public. The adoption of strong channel coding techniques appears to be of key importance for mobile operators and broadcasters. Low-density parity-check (LDPC) codes have been widely considered as error-correcting codes for next generation communication systems. A good LDPC decoder design requires both implementation friendly LDPC codes and efficient decoder architectures. The quality of LDPC code is crucial in determining the coding gain and implementation complexity of LDPC hardware decoders. This paper presents a turbo-decoding message-passing algorithm (TDMP) based LDPC code search algorithm with hardware considerations. The main advantages of the proposed algorithm over the DMB-TH standard decoding algorithm are 1) improvement in coding gain by an order of magnitude at high signal-to-noise ratio (SNR), 2) reduced decoder complexity. The performance of the proposed TDMP architecture is shown by the comparison of simulation results.

IEEE International Conference on Industrial Technology (ICIT)•Feb 1, 2009•1 citation

Memory-efficient turbo decoder architectures for LDPC codes

Mohammad M. Mansour, Naresh R. Shanbhag

In this paper, we propose a turbo decoding message-passing (TDMP) algorithm to decode regular and irregular low-density parity-check (LDPC) codes. The TDMP algorithm has two main advantages over the commonly employed two-phase message-passing algorithm. First, it exhibits a faster convergence behavior (up to 50% less iterations), and improvement in coding gain (up to an order of magnitude for moderate-to-high SNR and small number of iterations). Second, the corresponding decoder architecture has a significantly reduced memory requirement that amounts to a savings of (75 + 25n//spl Sigma/ node-degrees)% > 75% for code-length n. A decoder architecture featuring the TDNW algorithm is also presented. Furthermore, we propose a new structure on the parity-check matrix of an LDPC code based on permutation matrices aimed at reducing interconnect complexity and improving decoding throughput. In addition, we construct a wide range of LDPC codes based on Ramanujan graphs which possess this structure.

SiPS ... design and implementation - IEEE Workshop on Signal Processing Systems•Aug 27, 2003•35 citations

Improved LDPC Decoding Algorithm and Its DSP Implementation

Lenan Wu

Low Density Parity Check(LDPC) codes,a new channel coding method,have been successfully applied to the Second Generation of Satellite Digital Video Broadcasting system.In message passing algorithms for LDPC decoding,Min-Sum algorithm has lower complexity compared to the basic Log BP algorithm.However,it causes 0.5 dB performance degradation.In this paper a normalized factor is optimized using Gaussian approximation density evolution algorithm.Numerical results show that the improved algorithm can reduce the gap between Min-Sum and Log-BP,without increasing complexity.Finally this improved algorithm is implemented on a digital signal processor.

Modern Electronics Technique•Jan 1, 2007•0 citations

Research on Encoding and Decoding Algorithms of LDPC Codes

Yifeng He, Zhemin Duan

The LDPC code, namely low density parity check code, is essentially a linear block code.Its decoding performance is closer to the Shannon limit than the Turbo code.The definition and description of LDPC codes are introduced in this paper.LDPC coding method includes the Algorithm of LU decomposable encoding and the algorithm of partitioned iterated encoding.the algorithm of message passing, the algorithm of minimum-sum decoding and the algorithm of bit-flipping decoding are the common decoding algorithms of the LDPC codes.The concept and features of the encoding and decoding algorithms are explored in this paper to provide some references for the relative researchers.

International Conference on Materials Science, Machinery and Energy Engineering (MSMEE)•Jan 1, 2017•1 citation

Effect of Check Node Processing on the Performance of Message Passing Algorithm in the Context of LDPC Decoding for DVB-S2

M Girish Chandra, S.G. Harihara, B. S. Adiga +2 more

Low density parity check (LDPC) codes have become very popular in recent times due to their capacity approaching performance and are considered in the next generation digital video broadcasting DVB-S2 standard. This paper presents few results and observations obtained when some of the existing decoding algorithms are studied in the context of the standardized codes. These results with further consolidation will facilitate to arrive at the right algorithm for decoder design

International Conference on Information, Communications & Signal Processing (ICICS)•Sep 22, 2006•7 citations

Analysis of LDPC code performance over binary symmetric channel

Yuxiang Li

Low-Density Parity-Check code (LDPC) is a kind of linear block error-correcting codes.Sum-product algorithm is an iterative decoding algorithms commonly used in LDPC code decoding.This paper studies into the LDPC code message passing iterative decoding algorithm under the binary symmetric channel (BSC) and simulates the bit error probability,then simulates the convergence of check nodes' and variable nodes' probability density in the iterative process using the method of density evolution.The result show that under a given channel threshold,LDPC code has a good correction performance.

Journal of Northeast Normal University•Jan 1, 2010•0 citations
Low density parity check code being the most powerful Error correcting code with performance near to
Shannon limit is studied and simulated in this paper. Because of its performance it is used in Digital
Video Broadcasting Satellite for Second Generation (DVBS2).In this paper, LDPC encoding algorithm
named “Irregular repeat accumulated code” has been illustrated in detail. There are several algorithms
existing for the decoding of the LDPC decoder. Among them here, two decoding algorithm named “Turbo
decoding message passing Algorithm” and “Two phase message passing algorithm” has been illustrated
and simulated in MATLAB. The results comparing these two decoding algorithms and different iterations
have been presented in this paper.
Terrestrial digital multimedia TV/handle broadcasting (DMB-TH) is a newly upcoming framing structure, channel coding and modulation for digital television terrestrial broadcasting system standard of China, which is recently drafted and is ready to be verified in order to deploy mobile multimedia broadcasting services for the public. The adoption of strong channel coding techniques appears to be of key importance for mobile operators and broadcasters. Low-density parity-check (LDPC) codes have been widely considered as error-correcting codes for next generation communication systems. A good LDPC decoder design requires both implementation friendly LDPC codes and efficient decoder architectures. The quality of LDPC code is crucial in determining the coding gain and implementation complexity of LDPC hardware decoders. This paper presents a turbo-decoding message-passing algorithm (TDMP) based LDPC code search algorithm with hardware considerations. The main advantages of the proposed algorithm over the DMB-TH standard decoding algorithm are 1) improvement in coding gain by an order of magnitude at high signal-to-noise ratio (SNR), 2) reduced decoder complexity. The performance of the proposed TDMP architecture is shown by the comparison of simulation results.
In this paper, we propose a turbo decoding message-passing (TDMP) algorithm to decode regular and irregular low-density parity-check (LDPC) codes. The TDMP algorithm has two main advantages over the commonly employed two-phase message-passing algorithm. First, it exhibits a faster convergence behavior (up to 50% less iterations), and improvement in coding gain (up to an order of magnitude for moderate-to-high SNR and small number of iterations). Second, the corresponding decoder architecture has a significantly reduced memory requirement that amounts to a savings of (75 + 25n//spl Sigma/ node-degrees)% > 75% for code-length n. A decoder architecture featuring the TDNW algorithm is also presented. Furthermore, we propose a new structure on the parity-check matrix of an LDPC code based on permutation matrices aimed at reducing interconnect complexity and improving decoding throughput. In addition, we construct a wide range of LDPC codes based on Ramanujan graphs which possess this structure.
Low Density Parity Check(LDPC) codes,a new channel coding method,have been successfully applied to the Second Generation of Satellite Digital Video Broadcasting system.In message passing algorithms for LDPC decoding,Min-Sum algorithm has lower complexity compared to the basic Log BP algorithm.However,it causes 0.5 dB performance degradation.In this paper a normalized factor is optimized using Gaussian approximation density evolution algorithm.Numerical results show that the improved algorithm can reduce the gap between Min-Sum and Log-BP,without increasing complexity.Finally this improved algorithm is implemented on a digital signal processor.
The LDPC code, namely low density parity check code, is essentially a linear block code.Its decoding performance is closer to the Shannon limit than the Turbo code.The definition and description of LDPC codes are introduced in this paper.LDPC coding method includes the Algorithm of LU decomposable encoding and the algorithm of partitioned iterated encoding.the algorithm of message passing, the algorithm of minimum-sum decoding and the algorithm of bit-flipping decoding are the common decoding algorithms of the LDPC codes.The concept and features of the encoding and decoding algorithms are explored in this paper to provide some references for the relative researchers.
Low-Density Parity-Check code (LDPC) is a kind of linear block error-correcting codes.Sum-product algorithm is an iterative decoding algorithms commonly used in LDPC code decoding.This paper studies into the LDPC code message passing iterative decoding algorithm under the binary symmetric channel (BSC) and simulates the bit error probability,then simulates the convergence of check nodes' and variable nodes' probability density in the iterative process using the method of density evolution.The result show that under a given channel threshold,LDPC code has a good correction performance.