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

Distance spectrum based improved upper bounds for parallel and serial concatenated 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)
Sason, I. ; Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa, Israel ; Shamai, S.

The ensemble performance of parallel and serial concatenated turbo codes is considered, where the ensemble is generated by a uniform choice of the interleaver and of the component codes taken from the set of time varying recursive systematic convolutional codes. Following the derivation of the ensemble weight enumeration functions of random parallel and serial concatenated codes, improved upper bounds on the bit and message error probabilities of these ensembles of codes are derived and the influence of the interleaver length N and the memory length of the component codes m are investigated. The improved bounding technique proposed here, which is based on the tangential-sphere bound, is compared to the conventional union bound and to a recent alternative bounding technique by Duman and Salehi (1997) which incorporates modified Gallager bounds. The advantage of the derived bounds is demonstrated, especially in the region above the cutoff rate, including thus a portion of the rate region where the performance of turbo codes is most appealing

Published in:

Electrotechnical Conference, 1998. MELECON 98., 9th Mediterranean  (Volume:2 )

Date of Conference:

18-20 May 1998

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.