Design and performance of BICM-ID systems with hypercube constellations

Authors:
N. H. Tran;H. H. Nguyen
Affiliations:
Dept. of Electr. Eng., Saskatchewan Univ., Saskatoon, Sask., Canada;-
Venue:
IEEE Transactions on Wireless Communications
Year:
2006

Citing 0
Cited 9

Bit-Interleaved Coded Modulation

Foundations and Trends in Communications and Information Theory
Mapping rearrangement for HARQ based on low-order modulation

IEEE Transactions on Communications
Space shift keying modulation for MIMO channels

IEEE Transactions on Wireless Communications
Performance analysis and design criteria of BICM-ID with signal space diversity for keyhole Nakagami-m fading channels

IEEE Transactions on Information Theory
Log-concavity property of the error probability with application to local bounds for wireless communications

IEEE Transactions on Information Theory
Achieving close-capacity performance with simple concatenation scheme on multiple-antenna channels

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
A simple near-capacity bandwidth-efficient coded modulation scheme in rayleigh fading

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Achieving near-capacity performance on multiple-antenna channels with a simple concatenation scheme

IEEE Transactions on Communications
Multiple-frame precoding and multi-D mapping for BICM-NAF

Wireless Communications & Mobile Computing

Quantified Score

Hi-index	0.13

Visualization

Abstract

This paper introduces new mappings of QPSK symbols, viewed as a multi-dimensional hypercube, to improve the performance of bit-interleaved coded modulation with iterative decoding (BICM-ID). By evaluating the upper bound of the bit error rate performance of BICM-ID, a condition to find the best mapping of a hypercube constellation in terms of the asymptotic performance under different channel models is established. A general and simple algorithm to construct the best mapping of a hypercube is then proposed. Analytical and simulation results show that the use of the proposed mappings together with very simple convolutional codes can offer significant coding gains over the conventional BICM-ID systems for all the channel models considered. Such coding gains are achieved without bandwidth or power expansion and with a very small increase in the system complexity.