By Topic

Improved upper bounds on the ML performance of turbo codes for interleaved Rician fading channels, with comparison to iterative decoding

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
$33 $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 ML decoded turbo codes using coherent BPSK signaling on fully interleaved (memoryless) Rician fading channels is considered, where the ensemble is generated by a uniform choice of the interleaver. The improved bound proposed here is advantageous over the ubiquitous union bound, and it is especially pronounced in the rate region exceeding the cutoff rate (where the performance of turbo codes is most appealing but the union bounds become useless). The upper bounds are compared to simulation results of the log-MAP iterative decoding algorithm for various degrees of space diversity, demonstrating a good match. Hence the improved bounds can be used also as a fast technique to approximately assess the performance of efficient iterative decoding

Published in:

Communications, 2000. ICC 2000. 2000 IEEE International Conference on  (Volume:2 )

Date of Conference:

2000