Certain investigations on recent advances in the design of decoding algorithms using low‐density parity‐check codes and its applications
Citations Over TimeTop 11% of 2021 papers
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.
Related Papers
- → Hybrid Iterative Decoding for Low-Density Parity-Check Codes Based on Finite Geometries(2008)16 cited
- → Lowering the Error Floor of LDPC Codes by a Two-stage Hybrid Decoding Algorithm(2007)
- Adaptive LDPC Decoding Algorithm based on Theory of Density Evolution(2011)
- Min-zone selection decoding algorithm for LDPC codes(2008)
- → Improved Algorithm Based on Confidence Propagation Decoding Algorithm(2023)