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

Author

Ali, Syed Amjad ; Kambo, Nirmal Singh ; Ince, E.A.

Author_Institution

Dept. of Comput. Technol. & Inf. Syst., Bilkent Univ., Ankara

Volume

11

Issue

5

fYear

2007

fDate

5/1/2007 12:00:00 AM

Firstpage

399

Lastpage

401

Abstract

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

Keywords

Nakagami channels; channel coding; decoding; error statistics; interleaved codes; polynomials; transfer functions; turbo codes; channel state information; decoder; generator polynomial; interleaved Nakagami-m fading channel; pairwise error probability; transfer function; turbo codes; AWGN; Channel state information; Fading; Hamming weight; Pairwise error probability; Performance analysis; Rician channels; Transfer functions; Turbo codes; Upper bound;

fLanguage

English

Journal_Title

Communications Letters, IEEE

Publisher

ieee

ISSN

1089-7798

Type

jour

DOI

10.1109/LCOMM.2007.070082

Filename

4202086