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 Inventive Computing and Informatics (ICICI)

Investigations on performance analysis of various soft decision based LDPC decoding algorithms

Michaelraj Kingston Roberts, Elizabeth Sunny

Published Nov 1, 2017• 2 citations
Publisher

Abstract

In a transmission system the data transmitted from a source to destination gets corrupted due to noise and other non-linearities of the channel. Error Control Coding is a promising technique to minimize such error probabilities. LDPC codes are widely used for many practical applications. They exhibit excellent decoding performance with reduced computational complexity. This paper focuses on research issues related to decoding of various Low-Density Parity-Check (LDPC) codes.

DOI
10.1109/icici.2017.8365331

Related papers

Performance Analysis of LDPC Decoding Techniques

Abdel Halim A. Zikry, Ashraf Yehya Hassan, Wageda I. Shaban +1 more

Low density parity checking codes (LDPC) are one of the most important issues in coding theory at present. LDPC-code are a type of linear-block LDPC-codes. Channel coding might be considered as the finest conversant and most potent components of cellular communications systems, that was employed for transmitting errors corrections imposed by noise, fading and interfering. LDPC-codes are advanced coding gain, i.e., new area in coding. the performances of LDPC-code are similar to the Shannon-limiting, this led to the usage of decoding in several applications in digital communications systems, like DVB-S2 and WLAN802.1..This paper aims to know what is LDPC,what its application and introduce encoding algorithms that gives rise to a linear encoding time and also show that the regular and irregular LDPC performance and also introduce different methods for decoding LDPC. I discuss in detail LDPC decoding algorithm: bit flipping algorithm, as a type from hard decision .belief propagation algorithm, sum product algorithm and minimum sum algorithm as examples from soft decision .I expect that at least some students or researchers involved in researching LDPC codes would find this paper helpful.

International Journal of Recent Technology and Engineering (IJRTE)•Jan 30, 2021•5 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

Bit Flipping Decoders for LDPC Codes: A Short Survey

Kurakula Madhukar

In the domain of wireless communication systems, Error Control Coding schemes are one of the widely relied upon or responsible methodology for securing the integrity and authenticity of the data transmission process. In the last decade, due to the advent of modern communication standards and their wide range of services, there has been a resurgence of interest and support in the research community towards the conception of efficient and versatile error control coding techniques. Recent developments in the wireless communication-based technologies have witnessed the pliable nature of low-density parity-check (LDPC) codes and their contributions which cannot be overstated. As of now, the decoding schemes based on LDPC codes have emerged as one of the most promising and efective coding scheme for addressing several key problems of reliable data communication. In this article, comprehensive overview on the on some well-known LDPC hard decision decoding algorithms is provided. In addition, simulations carried out on various LDPC decoding algorithms based on their performance is also presented. Finally, at the end of this review, the scope for future prospects are forecasted through discussions.

•Nov 23, 2020•1 citation

Certain investigations on recent advances in the design of decoding algorithms using low‐density parity‐check codes and its applications

Michaelraj Kingston Roberts, Saru Kumari, Parthibaraj Anguraj

Summary Information theory coding is an impressive and most celebrated field of research that has spawned numerous extremely important solutions to the intractable problems of secure data communications. Recent advancements in error control coding methods have seen a huge surge in using low‐density parity‐check (LDPC) code‐based decoding algorithms to solve imperative issues related to reliable data transmission and reception. Till date, extensive research efforts have been consistently being made on LDPC codes which focus on algorithm‐driven and hardware‐realization‐based approaches. The main intension of this research work is to provide an extensive systematic elucidation on the recent advancements in LDPC decoding algorithms. In addition, a thorough performance evaluation and analysis of several outstanding LDPC decoding techniques is presented. Finally, conclusions are drawn by summarizing the important research findings, interesting open problems, current challenges and broader perspectives for future directions of research.

International Journal of Communication Systems•Mar 18, 2021•21 citations

Performance Evaluation of LDPC decoding Algorithm for GF (2)

D Patel Jigisha, Patel Ruchita Kumari

Low Density Parity Check (LDPC) codes are one of the block coding techniques that can approach the Shannon’s limit within a fraction of a decibel for high block lengths. In many digital communication systems, these codes have strong competitors of turbo codes for error control. LDPC codes performance depends on the excellent design of parity check matrix and many diverse research methods have been used by different study groups to evaluate the performance. Unlike many other classes of codes, LDPC codes are already equipped with a fast, probabilistic decoding algorithm. This makes LDPC codes not only attractive from a theoretical point of view, but also very suitable for practical applications. This paper throws hard decision and soft decision algorithm of LDPC. The hard decision algorithm contains Bit flipping algorithm and Soft decoding algorithm contains Sum product algorithm which is used to correct burst error. Sum Product algorithm is also called as belief propagation. Bit flipping and Sum Product algorithms are explained and can be implemented for the generated parity check matrix of (1016x508) for LDPC code with code rate 1/2.

Journal of Emerging Technologies and Innovative Research•Nov 1, 2014•0 citations

Computation of Parity Check Matrices for Binary EG-LDPC Codes used in Communication Systems

Jyothi Chinna Babu, C. Chinnapu Reddy

The Low Density Parity Check (LDPC) are direct codes, which are true block and Shannon Limit codes.These codes are attained least error floors of data bits for data transfer applications used in communication systems.However, the proposed LDPC codes are more beneficial than Turbo codes because of reduction in the decoding complexity and detection of the errors in less cycle time.This results the reduction of decoding time, low decoding latency, complexity and as well as least error floorings in communication, when the transmitted data contains multiple error bits.This paper is proposed to represent the majority logic decoding/detecting of LDPC codes.This paper proposes the Generation of Originator and Parity estimated matrices for the Binary LDPC Codes.Here, the proposed techniques are hard decision decrypting and soft decision decrypting schemes.These schemes uses majority logic decoding based on the data transmission and reception in communication channel.This paper also elaborates the effective calculation of Euclidean distance and algorithm for constructing the LDPC codes.

Helix•Feb 28, 2019•0 citations
In a transmission system the data transmitted from a source to destination gets corrupted due to noise and other non-linearities of the channel. Error Control Coding is a promising technique to minimize such error probabilities. LDPC codes are widely used for many practical applications. They exhibit excellent decoding performance with reduced computational complexity. This paper focuses on research issues related to decoding of various Low-Density Parity-Check (LDPC) codes.
Low density parity checking codes (LDPC) are one of the most important issues in coding theory at present. LDPC-code are a type of linear-block LDPC-codes. Channel coding might be considered as the finest conversant and most potent components of cellular communications systems, that was employed for transmitting errors corrections imposed by noise, fading and interfering. LDPC-codes are advanced coding gain, i.e., new area in coding. the performances of LDPC-code are similar to the Shannon-limiting, this led to the usage of decoding in several applications in digital communications systems, like DVB-S2 and WLAN802.1..This paper aims to know what is LDPC,what its application and introduce encoding algorithms that gives rise to a linear encoding time and also show that the regular and irregular LDPC performance and also introduce different methods for decoding LDPC. I discuss in detail LDPC decoding algorithm: bit flipping algorithm, as a type from hard decision .belief propagation algorithm, sum product algorithm and minimum sum algorithm as examples from soft decision .I expect that at least some students or researchers involved in researching LDPC codes would find this paper helpful.
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.
In the domain of wireless communication systems, Error Control Coding schemes are one of the widely relied upon or responsible methodology for securing the integrity and authenticity of the data transmission process. In the last decade, due to the advent of modern communication standards and their wide range of services, there has been a resurgence of interest and support in the research community towards the conception of efficient and versatile error control coding techniques. Recent developments in the wireless communication-based technologies have witnessed the pliable nature of low-density parity-check (LDPC) codes and their contributions which cannot be overstated. As of now, the decoding schemes based on LDPC codes have emerged as one of the most promising and efective coding scheme for addressing several key problems of reliable data communication. In this article, comprehensive overview on the on some well-known LDPC hard decision decoding algorithms is provided. In addition, simulations carried out on various LDPC decoding algorithms based on their performance is also presented. Finally, at the end of this review, the scope for future prospects are forecasted through discussions.
Summary Information theory coding is an impressive and most celebrated field of research that has spawned numerous extremely important solutions to the intractable problems of secure data communications. Recent advancements in error control coding methods have seen a huge surge in using low‐density parity‐check (LDPC) code‐based decoding algorithms to solve imperative issues related to reliable data transmission and reception. Till date, extensive research efforts have been consistently being made on LDPC codes which focus on algorithm‐driven and hardware‐realization‐based approaches. The main intension of this research work is to provide an extensive systematic elucidation on the recent advancements in LDPC decoding algorithms. In addition, a thorough performance evaluation and analysis of several outstanding LDPC decoding techniques is presented. Finally, conclusions are drawn by summarizing the important research findings, interesting open problems, current challenges and broader perspectives for future directions of research.
Low Density Parity Check (LDPC) codes are one of the block coding techniques that can approach the Shannon’s limit within a fraction of a decibel for high block lengths. In many digital communication systems, these codes have strong competitors of turbo codes for error control. LDPC codes performance depends on the excellent design of parity check matrix and many diverse research methods have been used by different study groups to evaluate the performance. Unlike many other classes of codes, LDPC codes are already equipped with a fast, probabilistic decoding algorithm. This makes LDPC codes not only attractive from a theoretical point of view, but also very suitable for practical applications. This paper throws hard decision and soft decision algorithm of LDPC. The hard decision algorithm contains Bit flipping algorithm and Soft decoding algorithm contains Sum product algorithm which is used to correct burst error. Sum Product algorithm is also called as belief propagation. Bit flipping and Sum Product algorithms are explained and can be implemented for the generated parity check matrix of (1016x508) for LDPC code with code rate 1/2.
The Low Density Parity Check (LDPC) are direct codes, which are true block and Shannon Limit codes.These codes are attained least error floors of data bits for data transfer applications used in communication systems.However, the proposed LDPC codes are more beneficial than Turbo codes because of reduction in the decoding complexity and detection of the errors in less cycle time.This results the reduction of decoding time, low decoding latency, complexity and as well as least error floorings in communication, when the transmitted data contains multiple error bits.This paper is proposed to represent the majority logic decoding/detecting of LDPC codes.This paper proposes the Generation of Originator and Parity estimated matrices for the Binary LDPC Codes.Here, the proposed techniques are hard decision decrypting and soft decision decrypting schemes.These schemes uses majority logic decoding based on the data transmission and reception in communication channel.This paper also elaborates the effective calculation of Euclidean distance and algorithm for constructing the LDPC codes.