ICTACT Journal on Communication Technology

Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

A Review On Construction Methods For Regular And Non-Quasi Cyclic LDPC Codes


Affiliations
1 Department of Electronics and Communication Engineering, Mohamed Sathak Engineering College, India
2 Department of Electrical and Electronics Engineering, Syed Ammal Engineering College, India
     

   Subscribe/Renew Journal


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.

Keywords

Low-Density Parity-Check (LDPC) Codes, Reed-Solomon (RS) Codes, SPA, Tanner Graph, Progressive Edge Growth (PEG), Message Passing, Non-Quasi Cyclic (NQC).
Subscription Login to verify subscription
User
Notifications
Font Size


  • A Review On Construction Methods For Regular And Non-Quasi Cyclic LDPC Codes

Abstract Views: 359  |  PDF Views: 0

Authors

S. Vengatesh Kumar
Department of Electronics and Communication Engineering, Mohamed Sathak Engineering College, India
R. Dhanasekaran
Department of Electrical and Electronics Engineering, Syed Ammal Engineering College, India

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.

Keywords


Low-Density Parity-Check (LDPC) Codes, Reed-Solomon (RS) Codes, SPA, Tanner Graph, Progressive Edge Growth (PEG), Message Passing, Non-Quasi Cyclic (NQC).

References