REVIEW ON CONSTRUCTION METHODS FOR REGULAR AND NON-QUASI CYCLIC LDPC CODES

Abstract
Low Density Parity Check (LDPC) codes are one of the most powerful error correction codes available today. Its Shannon capability that closely matches performance and lower decoding complexity has made them the best choice for many wired and wireless applications. This Paper provides an overview of the LDPC codes and compares the Gallager method, the Reed-Solomon-based algebraic method, and the combinatorial Progressive Growth (PEG) method for constructing regular LDPC codes and also Overlapped and Modified overlapped message passing algorithm for Non-Quasi Cyclic(NQC) LDPC codes

Authors
S Vengatesh Kumar1, R Dhanasekaran2
Mohamed Sathak Engineering College, India1, Syed Ammal Engineering College, India2

Keywords
Low-Density Parity-Check (LDPC) Codes, Reed-Solomon (RS) Codes, SPA, Tanner Graph, Progressive Edge Growth (PEG), Message Passing, Non-Quasi Cyclic (NQC)
Published By :
ICTACT
Published In :
ICTACT Journal on Communication Technology
( Volume: 10 , Issue: 3 )
Date of Publication :
October 2019
DOI :

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.