By Topic

Exact expression and tight bound on pairwise error probability for performance analysis of turbo codes over nakagami-m fading channels

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)
Ali, S.A. ; Dept. of Comput. Technol. & Inf. Syst., Bilkent Univ., Ankara ; Kambo, N.S. ; Ince, E.A.

This letter presents derivation for an exact and efficient expression on pairwise error probability over fully interleaved Nakagami-m fading channels under ideal channel state information at the decoder. As an outcome, this derivation also leads to a tight upper bound on pairwise error probability which is close to the exact expression. Pairwise error probability plots for different values of Nakagami parameter m along with an already existing numerically computable expression are provided. As an application of pairwise error probability, average union upper bounds for turbo codes having (1,7/5,7/5) and (1,5/7,5/7) generator polynomials employing transfer function approach are presented to illustrate the usefulness of the new efficient results

Published in:

Communications Letters, IEEE  (Volume:11 ,  Issue: 5 )