Open Access

New Technique for Improving Performance of LDPC Codes in the Presence of Trapping Sets

EURASIP Journal on Wireless Communications and Networking20082008:362897

DOI: 10.1155/2008/362897

Received: 2 December 2007

Accepted: 21 April 2008

Published: 5 May 2008

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.

Publisher note

To access the full article, please see PDF

Authors’ Affiliations

(1)
Computer Engineering Department, King Fahd University of Petroleum & Minerals
(2)
Electrical Engineering Department, King Fahd University of Petroleum & Minerals

Copyright

© Esa Alghonaim et al. 2008

This article is published under license to BioMed Central Ltd. 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.