Cart (Loading....) | Create Account
Close category search window
 

Efficient Stopping Criterion for Hybrid Weighted Symbol-Flipping Decoding of Nonbinary 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)
Bing Liu ; Dept. of Commun. Eng., Naval Univ. of Eng., Wuhan, China ; Gaoqi Dou ; Wei Tao ; Jun Gao

A two-stage hybrid iterative decoding algorithm with an efficient stopping criterion for nonbinary low-density parity-check (LDPC) codes is proposed, which combines weighted symbol-flipping (WSF) algorithm and fast Fourier transform q-ary sum-product algorithm (FFT-QSPA). The first WSF decoding would be stopped in advance by analyzing the trend of the number of unsatisfied checks. If the first stage decoding is stopped or failed, the second powerful FFT-QSPA is activated. The proposed decoding with the efficient stopping achieves error performance as good as that of FFT-QSPA with a low complexity, and converges faster than hybrid WSF (HWSF) algorithm.

Published in:

Communications Letters, IEEE  (Volume:15 ,  Issue: 3 )

Date of Publication:

March 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.