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

A fast algorithm to estimate the distance spectrum of turbo 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

3 Author(s)
Scalise, S. ; DLR, Wessling, Germany ; Young-Jik Ko Bae ; Ernst, H.

The computational complexity required by the complete calculation of the distance spectrum of turbo codes, even limited to low weight input sequences, makes it too slow for practical purposes such as interleaver optimization or effective bit error rate bounding. A fast algorithm for distance spectrum estimation purposes is presented. A comparison with complete computed spectra, theoretically derived spectra and results from previous works are presented for both deterministic and uniform interleavers.

Published in:

Telecommunications, 2003. ICT 2003. 10th International Conference on  (Volume:1 )

Date of Conference:

23 Feb.-1 March 2003

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.