Scheduled Maintenance on April 29th, 2016:
IEEE Xplore will be unavailable for approximately 1 hour starting at 11:30 AM EDT. We apologize for the inconvenience.
By Topic

On the suboptimality of iterative decoding for turbo-like and LDPC codes with cycles in their graph representation

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
$33 $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

3 Author(s)
M. Isaka ; Dept. of Informatics, Kwansei Gakuin Univ., Sanda, Japan ; M. P. C. Fossorier ; H. Imai

In this paper, we focus on the suboptimality of iterative decoding on graphs with cycles, through examining the use of a reliability-based decoding algorithm for some concatenated codes with an interleaver, known as turbo-like codes. The a posteriori probabilities delivered by the iterative decoding are regarded as reliability information, and an efficient algorithm for the overall linear block code is applied at certain iterations. Simulation results show that the suboptimality of iterative decoding due to cycles can be at least partially compensated by this approach. Some insights about the potential additional coding gains achievable are investigated based on the characteristics of the constituent decoders. These characteristics are related to the nature of suboptimality in the overall iterative decoding. The effects of some code parameters and channel conditions on the behavior of iterative decoding are also studied for a better understanding of its suboptimality.

Published in:

IEEE Transactions on Communications  (Volume:52 ,  Issue: 5 )