By Topic

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

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

2 Author(s)
Yuheng Huang ; Dept. of Electr. Eng., Univ. of Washington, Seattle, WA, USA ; J. A. Ritcey

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.

Published in:

IEEE Transactions on Information Theory  (Volume:51 ,  Issue: 5 )