New Technique For Improving Performance Of LDPC Codes In The Presence Of Trapping Sets

(2008) New Technique For Improving Performance Of LDPC Codes In The Presence Of Trapping Sets. HINDAWI PUBLISHING CORPORATION, EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING.

[img]
Preview
PDF
5754_1.pdf

Download (26kB) | Preview
[img] Microsoft Word
5754_2.doc

Download (18kB)

Abstract

Trapping sets are considered the primary factor for degrading the performance of low-density parity-check (LDPC) codes in the error-floor region. The effect of trapping sets on the performance of an LDPC code becomes worse as the code size decreases. One approach to tackle this problem is to minimize trapping sets during LDPC code design. However, while trapping sets can be reduced, their complete elimination is infeasible due to the presence of cycles in the underlying LDPC code bipartite graph. In this work, we introduce a new technique based on trapping sets neutralization to minimize the negative effect of trapping sets under belief propagation ( BP) decoding. Simulation results for random, progressive edge growth ( PEG) and MacKay LDPC codes demonstrate the effectiveness of the proposed technique. The hardware cost of the proposed technique is also shown to be minimal. Copyright (c) 2008 Esa Alghonaim et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Item Type: Article
Subjects: General
Divisions: General
Depositing User: Users 4454 not found.
Date Deposited: 19 Aug 2008 09:04
Last Modified: 01 Nov 2019 17:09
URI: http://eprints.kfupm.edu.sa/id/eprint/16120