By Topic

Adaptive Mixed Scheduling for Correcting Errors in Trapping Sets of LDPC Codes

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

4 Author(s)
Saejoon Kim ; Dept. of Comput. Sci., Eng., Sogang Univ., Seoul, South Korea ; Seunghyuk Lee ; Jun Heo ; Rim, C.S.

Trapping sets of low-density parity-check codes are the problematic substructures that contribute to the error floor behavior under iterative decoding. Adoption of mixed scheduling for belief propagation decoding has shown to be very effective in solving some of the trapping sets. In this letter, we propose an adaptive mixed scheduling scheme that provides significantly improved code performance compared to existing mixed scheduling schemes.

Published in:

Communications Letters, IEEE  (Volume:14 ,  Issue: 7 )