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 Communication Systems

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

Published Mar 18, 2021• 21 citations
Publisher

Abstract

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.

DOI
10.1002/dac.4765

Related papers

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

Michaelraj Kingston Roberts, Elizabeth Sunny

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.

International Conference on Inventive Computing and Informatics (ICICI)•Nov 1, 2017•2 citations

A comprehensive Study of Decoding Algorithms for Low Density Parity-Check(LDPC)

C S Anil Kumar, M Vedhashri, L Vanditha +2 more

The near-capacity performance and effective decoding algorithms of Low-Density Parity-Check (LDPC) codes have made them a mainstay of contemporary error correction. With an emphasis on iterative techniques like the Belief Propagation (BP) algorithm, the Min-Sum algorithm, and their variations, this paper offers a thorough analysis of decoding algorithms for LDPC codes. We investigate the trade-offs between various algorithmic techniques’ computational complexity, decoding latency, and error correction performance. Particular focus is placed on new methods and hardware-friendly algorithms that are tailored for next-generation communication systems, such 5 G and beyond.

International Conference on Knowledge Engineering and Communication Systems (ICKECS)•Apr 28, 2025•0 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

Research and Improvement of LPDC Decoding Algorithm

Tingting Chen, Riuan Liu, Lirong Diao

Low Density Parity Check(LDPC) code itself has a good performance and the application of LDPC in the communication field is extensive.LDPC codes have the characteristics of low bit error rate, easy adjustment, low decoding complexity and excellent decoding performance.LDPC is considered to be the "best performance" in the field of coding and decoding [1] .In this paper, we mainly introduce the theory of LDPC codes.And the use of the method of the LDPC code to do a further explanation.Several simple decoding schemes of LDPC are studied.Finally, using the method of function approximation to replace the confidence function to improve the BP LLR algorithm, and simulation experiments are carried out.

International Conference on Mechatronics Engineering and Information Technology (ICMEIT)•Jan 1, 2016•0 citations

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

Linear programming decoding: The ultimate decoding technique for low density parity check codes

Mohammad Rakibul Islam

Linear programming (LP) decoding is an alternative to iterative algorithms for decoding low density parity check (LDPC) codes. Although the practical performance of LP decoding is comparable to message-passing decoding, a significant advantage is its relative amenability to nonasymptotic analysis. Moreover, there turn out to be a number of important theoretical connections between the LP decoding and standard forms of iterative decoding. These connections allow theoretical insight from the LP decoding perspective to be transferred to iterative decoding algorithms. These advantages encouraged many researchers to work in this recent decoding technique for LDPC codes. In this paper, LP decoding for LDPC code is extensively reviewed and is discussed in different segmented areas.

Radioelectronics and Communications Systems•Feb 1, 2013•2 citations
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.
The near-capacity performance and effective decoding algorithms of Low-Density Parity-Check (LDPC) codes have made them a mainstay of contemporary error correction. With an emphasis on iterative techniques like the Belief Propagation (BP) algorithm, the Min-Sum algorithm, and their variations, this paper offers a thorough analysis of decoding algorithms for LDPC codes. We investigate the trade-offs between various algorithmic techniques’ computational complexity, decoding latency, and error correction performance. Particular focus is placed on new methods and hardware-friendly algorithms that are tailored for next-generation communication systems, such 5 G and beyond.
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.
Low Density Parity Check(LDPC) code itself has a good performance and the application of LDPC in the communication field is extensive.LDPC codes have the characteristics of low bit error rate, easy adjustment, low decoding complexity and excellent decoding performance.LDPC is considered to be the "best performance" in the field of coding and decoding [1] .In this paper, we mainly introduce the theory of LDPC codes.And the use of the method of the LDPC code to do a further explanation.Several simple decoding schemes of LDPC are studied.Finally, using the method of function approximation to replace the confidence function to improve the BP LLR algorithm, and simulation experiments are carried out.
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.
Linear programming (LP) decoding is an alternative to iterative algorithms for decoding low density parity check (LDPC) codes. Although the practical performance of LP decoding is comparable to message-passing decoding, a significant advantage is its relative amenability to nonasymptotic analysis. Moreover, there turn out to be a number of important theoretical connections between the LP decoding and standard forms of iterative decoding. These connections allow theoretical insight from the LP decoding perspective to be transferred to iterative decoding algorithms. These advantages encouraged many researchers to work in this recent decoding technique for LDPC codes. In this paper, LP decoding for LDPC code is extensively reviewed and is discussed in different segmented areas.