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

The distribution of loop lengths in graphical models for turbo decoding

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

3 Author(s)
Xianping Ge ; Dept. of Inf. & Comput. Sci., California Univ., Irvine, CA, USA ; Eppstein, D. ; Smyth, P.

This correspondence analyzes the distribution of loop lengths in graphical models for turbo decoding. The properties of such loops are of significant interest in the context of iterative decoding algorithms based on belief propagation. We estimate the probability that there exist no loops of length less than or equal to c at a randomly chosen node in the acyclic directed graphical (ADC) model for turbo decoding, using a combination of counting arguments and approximations. When K, the number of information bits, is large, this probability is approximately e -2c-1-4/K, for c⩾4, where nodes for input information bits are ignored for convenience. The analytical results are validated by simulations. For example, for turbo codes with K=64,000, a randomly chosen node has a less than 1% chance of being on a loop of length less than or equal to 10, but has a greater than 99.9% chance of being on a loop of length less than or equal to 20

Published in:

Information Theory, IEEE Transactions on  (Volume:47 ,  Issue: 6 )

Date of Publication:

Sep 2001

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.