Improved upper bound on the bit error probability of turbo codes for ML decoding with imperfect CSI in a Rayleigh fading channel

Author

Shin, Hyundong ; Lee, Jae Hong

Author_Institution

Sch. of Electr. Eng., Seoul Nat. Univ., South Korea

Volume

1

fYear

2001

fDate

37135

Abstract

We investigate an improved upper bound on the bit error probability of turbo codes for the maximum likelihood (ML) decoding with imperfect channel state information (CSI) in a fully interleaved Rayleigh fading channel. The upper bound is based on the Viterbi & Viterbi (see Proc. of the IEEE Inform. Theory Workshop ´98, San Diego, CA, Feb. 1998, p.72) bound and is also compared with iterative decoding using the log-MAP algorithm. It is shown that the upper bound well approximates the simulation results of the iterative decoding below a BER of 10^-5

Keywords

AWGN; Rayleigh channels; convolutional codes; error statistics; iterative decoding; maximum likelihood decoding; turbo codes; BER; BPSK; ML decoding; Viterbi bound; additive white Gaussian noise; binary phase shift keying; bit error probability; imperfect CSI; imperfect channel state information; interleaved Rayleigh fading channel; iterative decoding; log-MAP algorithm; maximum likelihood decoding; recursive systematic convolutional encoders; simulation results; turbo codes; upper bound; Channel state information; Conferences; Error probability; Fading; Iterative algorithms; Iterative decoding; Maximum likelihood decoding; Turbo codes; Upper bound; Viterbi algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Personal, Indoor and Mobile Radio Communications, 2001 12th IEEE International Symposium on

Conference_Location

San Diego, CA

Print_ISBN

0-7803-7244-1

Type

conf

DOI

10.1109/PIMRC.2001.965414

Filename

965414