Optimal constellation labeling for iteratively decoded bit-interleaved space-time coded Modulation

  • Authors:
  • Y. Huang;J. A. Ritcey

  • Affiliations:
  • Dept. of Electr. Eng., Univ. of Washington, Seattle, WA, USA;-

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2005

Quantified Score

Hi-index 754.84

Visualization

Abstract

We consider the design of iteratively decoded bit-interleaved space-time coded modulation (BI-STCM) over fast Rayleigh-fading channels with Nt transmit and Nr receive antennas. We propose the design criterion to achieve the largest asymptotic coding gain inherited in the constellation labeling. In particular, for orthogonal space-time block codes, the labeling design criterion reduces to maximizing the (-NtNr)th power mean of the complete set of squared Euclidean distances associated with all "error-free feedback" events in the constellation. Based on this power mean criterion, we show that the labeling optimization problem falls into the category of quadratic assignment problems for constellations of any shape and with an arbitrary number of transmit and receive antennas. For a set of practical values of Nt and Nr, we present optimal labeling maps for 8-PSK, 16-QAM, and 64-QAM constellations.