Loading...

A PEG construction of finite-length LDPC codes with low error floor

Khazraie, S ; Sharif University of Technology | 2012

454 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/LCOMM.2012.060112.120844
  3. Publisher: 2012
  4. Abstract:
  5. The progressive-edge-growth (PEG) algorithm of Hu et al. is modified to improve the error floor performance of the constructed low-density parity-check (LDPC) codes. To improve the error floor, the original 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 under-construction code by the addition of each variable node and its adjacent edges. The aim is to select the edges, among the candidates available at each step of the original PEG algorithm, that prevent the creation of dominant ETS's. The proposed method is applicable to both 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 constructed by the original and other modifications of the PEG algorithm
  6. Keywords:
  7. Code construction ; Elementary trapping sets ; Error floor ; Low density parity-check (LDPC) codes ; Progressive edge growth (PEG) algorithm ; Trapping sets ; Low-density parity-check codes ; Progressive-edge-growth algorithms ; Algorithms ; Block codes ; Forward error correction ; Floors
  8. Source: IEEE Communications Letters ; Volume 16, Issue 8 , 2012 , Pages 1288-1291 ; 10897798 (ISSN)
  9. URL: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6211373