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 Conference on Information, Communications & Signal Processing (ICICS)

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, P. Balamuralidhar, P.S. Subramanian

Published Sep 22, 2006• 7 citations
Publisher

Abstract

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

DOI
10.1109/icics.2005.1689281

Related papers

Effect ofCheck Node Processingon thePerformance of Message PassingAlgorithmintheContext of LDPC Decoding forDVB-S2

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

LowDensity Parity Check(LDPC)codes havebecome verypopular inrecent times duetotheir capacity approaching performance andareconsidered inthenextgeneration digital videobroadcasting DVB-S2standard. Thispaperpresents few results andobservations obtained whensomeoftheexisting decoding algorithms are studied in thecontextof the standardized codes. Theseresults withfurther consolidation will facilitate toarrive attheright algorithm fordecoder design.

•Jan 1, 2005•0 citations

Performance comparison of Decoding Algorithm for LDPC codes in DVBS2

Ronakben P Patel, Prof.Pooja Thakar

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.

International journal of advance research and innovative ideas in education•Jan 1, 2016•1 citation

Fast convergence algorithm for decoding of low density parity check codes

Jin Xie, Liuguo Yin, Ning Ge +1 more

Abstract: In this paper, a fast-convergence algorithm is proposed for the decoding of low-density parity-check (LDPC) codes. By putting more weight on the message update from check node to variable node in current iteration, the proposed method speeds up the decoding significantly. Simulation results show that compared with the standard layered min-sum decoding algorithm, the proposed scheme may reduce about 1/6 iteration numbers for LDPC codes used in DVB-S2, with hardware complexity overhead less than 2%. Key–Words: LDPC code, fast convergence decoding algorithm, layered decoding, min-sum algorithm, hardware implementation 1

WSEAS TRANSACTIONS on COMMUNICATIONS archive•Jul 1, 2009•1 citation

Alternative Approximation of Check Node Algorithm for DVB-S2 LDPC Decoder

O. Eljamaly Toumaz, P. Sweeney

In this paper, a new approximation of the check node rule algorithm is proposed for updating the check nodes messages in LDPC decoding. The new technique evaluates the check node min-sum magnitude algorithm using the Taylor series and results in reduced computational complexity and hardware implementation. The architecture of a check node processing unit, implementing the new alternative approximation of the check node, is also presented. The proposed method can achieve the same BER performance with a reduction of ~20% hardware complexity in the LDPE decoder. The simulation results obtained shows that the packet error rate performance of 10-7, which is the DVB-S2 requirement for MPEG packets transmitted, can be achieved with this new method.

International Conference on Systems and Networks Communications•Aug 1, 2007•5 citations

Resource efficient flexible architectures for low-density parity-check decoders

Vikram Arkalgud Chandrasetty

Digital communication has become part of most applications we use today.It could be for internet access using WLAN/WiMAX technology or satellite based Digital Video Broadcasting (DVB) or even mobile applications.It may be possible to achieve very high communication bandwidth for these applications.But the problem is with the reliability of information received over the communication channel that is often subjected to noise.The obvious solution to this problem is incorporating error correction techniques in the communication system to correct the errors introduced during transit.One of the best performing error correction codes are Low-Density Parity-Check (LDPC) codes discovered by Gallager in 1962, but these codes only gained popularity over the last decade or so.LDPC codes can achieve excellent bit error rate (BER) performance and are very suitable for next-generation communication systems.Studies have shown that large LDPC codes can achieve BER performance very close to the Shannon Limit.Hence these codes are of paramount interest among the research community.However, practical implementation of high performance LDPC decoders with large code lengths is a challenge faced by designers today due to the huge complexity and hardware resources required.This research aims to reduce the complexity of LDPC decoding algorithms and explore resource efficient architectures for hardware implementation.LDPC decoders are primarily based on iterative algorithms and typically consist of large number of computational nodes, with complex interconnections among the nodes.A fully-parallel implementation of LDPC decoder with large code length can provide high throughput, but is costly in terms of hardware resources required.Even today's high-end FPGAs

•Jan 1, 2012•0 citations

Implementation of a Flexible LDPC Decoder

Guido Masera, Federico Quaglio, F. Vacca

Low-density parity-check codes (LDPC) are among the most powerful error correcting tools today available. For this reason they became very popular in several applications such as the digital satellite broadcasting system (DVB-S2), wireless local area network (IEEE 802.11n) and metropolitan area network (802.16e). Whereas several code-specific decoders have been proposed in the literature, the implementation of a high performance yet flexible LDPC decoder still is a challenging topic. This work presents a novel formulation of the decoding algorithm that strongly simplifies internal communication requirements and enables the development of decoders supporting generally defined LDPC codes. The resulting architecture is tailored to decode both IEEE 802.11n and IEEE 802.16e LDPC codes, as well as any other code of comparable complexity. The implementation cost deriving from the full flexibility offered by the proposed approach is also evaluated.

IEEE Transactions on Circuits and Systems II Analog and Digital Signal Processing•Jun 1, 2007•124 citations
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
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.
Abstract: In this paper, a fast-convergence algorithm is proposed for the decoding of low-density parity-check (LDPC) codes. By putting more weight on the message update from check node to variable node in current iteration, the proposed method speeds up the decoding significantly. Simulation results show that compared with the standard layered min-sum decoding algorithm, the proposed scheme may reduce about 1/6 iteration numbers for LDPC codes used in DVB-S2, with hardware complexity overhead less than 2%. Key–Words: LDPC code, fast convergence decoding algorithm, layered decoding, min-sum algorithm, hardware implementation 1
In this paper, a new approximation of the check node rule algorithm is proposed for updating the check nodes messages in LDPC decoding. The new technique evaluates the check node min-sum magnitude algorithm using the Taylor series and results in reduced computational complexity and hardware implementation. The architecture of a check node processing unit, implementing the new alternative approximation of the check node, is also presented. The proposed method can achieve the same BER performance with a reduction of ~20% hardware complexity in the LDPE decoder. The simulation results obtained shows that the packet error rate performance of 10-7, which is the DVB-S2 requirement for MPEG packets transmitted, can be achieved with this new method.
Digital communication has become part of most applications we use today.It could be for internet access using WLAN/WiMAX technology or satellite based Digital Video Broadcasting (DVB) or even mobile applications.It may be possible to achieve very high communication bandwidth for these applications.But the problem is with the reliability of information received over the communication channel that is often subjected to noise.The obvious solution to this problem is incorporating error correction techniques in the communication system to correct the errors introduced during transit.One of the best performing error correction codes are Low-Density Parity-Check (LDPC) codes discovered by Gallager in 1962, but these codes only gained popularity over the last decade or so.LDPC codes can achieve excellent bit error rate (BER) performance and are very suitable for next-generation communication systems.Studies have shown that large LDPC codes can achieve BER performance very close to the Shannon Limit.Hence these codes are of paramount interest among the research community.However, practical implementation of high performance LDPC decoders with large code lengths is a challenge faced by designers today due to the huge complexity and hardware resources required.This research aims to reduce the complexity of LDPC decoding algorithms and explore resource efficient architectures for hardware implementation.LDPC decoders are primarily based on iterative algorithms and typically consist of large number of computational nodes, with complex interconnections among the nodes.A fully-parallel implementation of LDPC decoder with large code length can provide high throughput, but is costly in terms of hardware resources required.Even today's high-end FPGAs
Low-density parity-check codes (LDPC) are among the most powerful error correcting tools today available. For this reason they became very popular in several applications such as the digital satellite broadcasting system (DVB-S2), wireless local area network (IEEE 802.11n) and metropolitan area network (802.16e). Whereas several code-specific decoders have been proposed in the literature, the implementation of a high performance yet flexible LDPC decoder still is a challenging topic. This work presents a novel formulation of the decoding algorithm that strongly simplifies internal communication requirements and enables the development of decoders supporting generally defined LDPC codes. The resulting architecture is tailored to decode both IEEE 802.11n and IEEE 802.16e LDPC codes, as well as any other code of comparable complexity. The implementation cost deriving from the full flexibility offered by the proposed approach is also evaluated.