By Topic

Comments on “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

1 Author(s)
Maciej Krasicki ; Dept. of Wireless Commun., Poznan Univ. of Technol., Poznań, Poland

Having developed an optimization criterion, the authors of the commented paper used the Reactive Tabu Search algorithm to find several optimal labeling maps of bit-interleaved space-time coded modulation with iterative decoding, one per each considered system diversity order. However, they might have overlooked the fact that some of the contributed 16-QAM labelings are equivalent to one another. It is shown in this paper by means of spectral analysis and reinforced by computation of the asymptotic coding gain. Thus, there is no need to switch 16-QAM labeling maps when reconfiguring the system from one diversity scheme to another, which makes the results of Huang and Ritcey's contribution even more valuable from a practical point of view.

Published in:

IEEE Transactions on Information Theory  (Volume:58 ,  Issue: 7 )