Skip to main content

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

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

Author information

Affiliations

Authors

Corresponding author

Correspondence to Esa Alghonaim.

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and Permissions

About this article

Cite this article

Alghonaim, E., El-Maleh, A. & Adnan Landolsi, M. New Technique for Improving Performance of LDPC Codes in the Presence of Trapping Sets. J Wireless Com Network 2008, 362897 (2008). https://doi.org/10.1155/2008/362897

Download citation

Keywords

  • Information System
  • Improve Performance
  • Bipartite Graph
  • System Application
  • Primary Factor