A PEG Construction of Finite-Length LDPC Codes with Low Error Floor


The progressive-edge-growth (PEG) algorithm of Hu et al. is modified to boost the error floor performance of the made low-density parity-check (LDPC) codes. To enhance the error floor, the initial PEG algorithm is equipped with an efficient algorithm to find the dominant elementary trapping sets (ETS's) that are added to the Tanner graph of the underneath-construction code by the addition of each variable node and its adjacent edges. The aim is to select the edges, among the candidates offered at each step of the first PEG algorithm, that stop the creation of dominant ETS's. The proposed methodology is applicable to each regular and irregular variable node degree distributions. Simulation results are presented to demonstrate the superior ETS distribution and error floor performance of the constructed codes compared to similar codes made by the original and different modifications of the PEG algorithm.

Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here

PROJECT TITLE : Cross-Layer Aided Energy-Efficient Opportunistic Routing in Ad Hoc Networks - 2014 ABSTRACT: Most of the nodes in ad hoc networks rely on batteries, which requires energy saving. Hence, numerous energy-efficient
PROJECT TITLE :The Generalization Ability of Online Algorithms for Dependent Data - 2013ABSTRACT:We study the generalization performance of online learning algorithms trained on samples coming from a dependent source of data.

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry