Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.

Article

Download BibTeX

Title

Comments on "Optimal constellation labeling for iteratively decoded bit-interleaved space-time coded modulation"

Authors

[ 1 ] Katedra Radiokomunikacji, Wydział Elektroniki i Telekomunikacji, Politechnika Poznańska | [ P ] employee

Year of publication

2012

Published in

IEEE Transactions on Information Theory

Journal year: 2012 | Journal volume: vol. 58 | Journal number: no. 7

Article type

scientific article

Publication language

english

Abstract

EN 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.

Pages (from - to)

4967 - 4968

DOI

10.1109/TIT.2012.2194135

URL

https://ieeexplore.ieee.org/document/6179994

Impact Factor

2,621

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.