Scheduled System Maintenance:
On May 6th, system maintenance will take place from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). During this time, there may be intermittent impact on performance. We apologize for the inconvenience.
By Topic

Detailed evaluation of error floors of LDPC codes using the probabilistic algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hirotomo, M. ; Grad. Sch. of Eng., Kobe Univ., Kobe, Japan ; Morii, M.

The performance of LDPC codes decoded by iterative algorithm depends on the structural properties of their underlying Tanner graphs. For discrete memoryless channels, error patterns dominating the frame error rate (FER) in the error floor region are termed trapping set. We have shown approximate examinations of small trapping sets of LDPC codes using the probabilistic algorithm. In this paper, we propose an efficient method for the detailed evaluation of the FER of LDPC codes in the error floor region. The accuracy of the FER lies on the failure probability of the number of trapping sets determined by our probabilistic algorithm and the FER estimated by the importance sampling.

Published in:

Information Theory and its Applications (ISITA), 2010 International Symposium on

Date of Conference:

17-20 Oct. 2010