Multidimensional mappings for iteratively decoded BICM on multiple-antenna channels Academic Article

abstract

• Multidimensional binary mappings for bit-interleaved coded modulations (BICMs) on ergodic multiple-antenna channels with iterative decoding are presented. After derivation of a closed-form expression for the pairwise error probability under ideal maximum-likelihood (ML) decoding, the design criterion for mapping optimization is established from the ML performance of the ideally interleaved channel. It coincides with the figure of merit derived from the genie condition when the iterative receiver converges to perfecta prion information. Multidimensional mapping constructions that exhibit high signal-to-noise ratio (SNR) gains without increasing the complexity of the a posterion probability (APP) detection are proposed. They allow for a reduced decoding complexity as they achieve near turbo code performance with a single convolutional code. 2005 IEEE.

authors

• Boutros, Joseph

published proceedings

• IEEE TRANSACTIONS ON INFORMATION THEORY

author list (cited authors)

• Gresset, N., Boutros, J. J., & Brunel, L.

citation count

• 35

complete list of authors

• Gresset, N||Boutros, JJ||Brunel, L

publication date

• September 2005

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE TRANSACTIONS ON INFORMATION THEORY  Journal

keywords

• Binary Mapping
• Bit-interleaved Coded Modulation
• Multiple-antenna Channels
• Pairwise Error Probability

Digital Object Identifier (DOI)

• 10.1109/TIT.2005.853306

start page

• 3337

end page

• 3346

volume

• 51

issue

• 9

URL

• http%3A%2F%2Fdx.doi.org%2F10.1109%2Ftit.2005.853306