By Topic

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

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)
Hyundong Shin ; Sch. of Electr. Eng., Seoul Nat. Univ., South Korea ; Jae Hong Lee

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

Published in:

Personal, Indoor and Mobile Radio Communications, 2001 12th IEEE International Symposium on  (Volume:1 )

Date of Conference:

Sep 2001