Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

On error bounds and 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

2 Author(s)
Schlegel, C. ; Dept. of Electr. Eng., Utah Univ., Salt Lake City, UT, USA ; Perez, L.

Turbo-codes have been hailed as the ultimate step toward achieving the capacity limit Shannon established some 50 years ago. We look at the performance of turbo-codes with respect to various information theoretic error bounds. This comparison suggests that, if (block, or) frame error rates are considered, careful interleaver design is necessary to ensure an error performance within a fraction of a decibel of the theoretical limit for large block sizes, while random interleavers perform well for block sizes smaller than about 2 K. If the bit error performance is considered, interleaver design seems to have only a minor effect, and the codes perform close to the limit for all block sizes considered.

Published in:

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