By Topic

A Unified Early Stopping Criterion for Binary and Nonbinary LDPC Codes Based on Check-Sum Variation Patterns

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)
Guojun Han ; Dept. of Electron. & Commun. Eng., Sun Yat-sen Univ., Guangzhou, China ; Xingcheng Liu

In order to detect uncorrectable error frames and early terminate their iterative belief-propagation (BP) decoding for binary or nonbinary LDPC codes, a unified early stopping criterion using check-sum variation patterns is proposed. In addition to low computational overhead and easy choice of threshold parameters, it can be adapted to different channels. Simulation results show that the proposed criterion greatly reduces the average number of iterations (ANI) at low to medium signal-to-noise ratio (SNR) while keeping the error performance degradation negligible over a wide SNR region.

Published in:

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