On the suitability of gray bit mappings to outer channel codes in iteratively decoded BICM

Deliberately designed bits-to-symbols mappings were introduced to provide significant coding gains compared to the simple Gray mapping for iteratively-decoded BICM on both AWGN and fading channels. The performance of these powerful mappings has always been illustrated in conjunction with relatively...

Full description

Saved in:
Bibliographic Details
Main Authors: Samuel, Michael, Barsoum, Maged, Fitz, Michael P
Format: Conference Proceeding
Language:English
Subjects:
Binary phase shift keying
Convolutional codes
Euclidean distance
Iterative decoding
MIMO
Multidimensional systems
Mutual information
Partitioning algorithms
Quadrature phase shift keying
Turbo codes
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Deliberately designed bits-to-symbols mappings were introduced to provide significant coding gains compared to the simple Gray mapping for iteratively-decoded BICM on both AWGN and fading channels. The performance of these powerful mappings has always been illustrated in conjunction with relatively weak outer channel codes like convolutional codes with up to 16 states. However, when a powerful outer code like a parallel concatenated turbo code is employed, a simple Gray mapping becomes significantly superior in performance. The aim of this letter is to give a simple and straightforward interpretation of this discrepancy in behavior based on the extrinsic information transfer chart of the iterative receivers in both cases. Parts of the presented results are scattered in the literature but this letter presents a unified look on the mapping suitability problem and answers positively the question of: ¿if a turbo code is used as an outer code in a BICM transmission, is Gray-mapping more suitable than other more complex candidates?¿.
ISSN:1058-6393
2576-2303
DOI:10.1109/ACSSC.2009.5470030