• DocumentCode
    1489688
  • Title

    Comments on “Optimal Constellation Labeling for Iteratively Decoded Bit-Interleaved Space-Time Coded Modulation”

  • Author

    Krasicki, Maciej

  • Author_Institution
    Dept. of Wireless Commun., Poznan Univ. of Technol., Poznań, Poland
  • Volume
    58
  • Issue
    7
  • fYear
    2012
  • fDate
    7/1/2012 12:00:00 AM
  • Firstpage
    4967
  • Lastpage
    4968
  • Abstract
    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.
  • Keywords
    interleaved codes; iterative decoding; modulation coding; search problems; space-time codes; spectral analysis; asymptotic coding gain; iteratively decoded bit-interleaved space-time coded modulation; optimal constellation labeling; optimization criterion; reactive tabu search algorithm; spectral analysis; switch 16-QAM labelings; system diversity order; Decoding; Iterative decoding; Space-time codes; labeling; modulation; space-time codes;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2012.2194135
  • Filename
    6179994