By Topic

Mapping optimization for the map turbo-detector with channel estimation

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

3 Author(s)
Sihem Chaabouni ; ENIS, Laboratoire LETI, Route Soukra km 3.5, 3038 Sfax, Tunisia ; Noura Sellami ; Mohamed Siala

In this paper, we consider a bit interleaved coded modulation (BIC M) scheme over a frequency selective channel. At the receiver, a turbo-detector composed of a maximum a posteriori (MAP) equalizer, and a MAP decoder is used. The channel is supposed to be unknown at the receiver and estimated using pilot symbols. The aim of the paper is to optimize the mapping between the coded bits and the transmitted modulated symbols in this context. To do this, we derive an upper bound of the bit error probability (BEP) at the output of the equalizer fed with a priori information from the decoder and with the channel estimation. We then give an analytical approximate expression of this BEP when the a priori information provided by the decoder is reliable (most errors at the output of the equalizer are isolated). We propose to find the mapping minimizing this expression. Since an exhaustive search is very complicated when the modulation order is high, we propose to approach the solution using the Binary Switching Algorithm (BSA).

Published in:

2012 IEEE 13th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)

Date of Conference:

17-20 June 2012