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

ICTACT Journal on Communication Technology ( Volume: 10 , Issue: 3 )

Abstract

vioft2nntf2t|tblJournal|Abstract_paper|0xf4ff58562b000000ba6d030001000400
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
September 2019
Pages
2024-2029

ICT Academy is an initiative of the Government of India in collaboration with the state Governments and Industries. ICT Academy is a not-for-profit society, the first of its kind pioneer venture under the Public-Private-Partnership (PPP) model

Contact Us

ICT Academy
Module No E6 -03, 6th floor Block - E
IIT Madras Research Park
Kanagam Road, Taramani,
Chennai 600 113,
Tamil Nadu, India

For Journal Subscription: journalsales@ictacademy.in

For further Queries and Assistance, write to us at: ictacademy.journal@ictacademy.in