Many techniques for constructing unitary space- time constellations have been proposed. To minimize bit-error rate (BER) in a wireless communication system, constellations constructed using these techniques should be given a Gray- code type bit assignment, where symbols which are close in signal space have bit assignments which have small Hamming distance. To the authors' knowledge, no efficient general strategy for making this bit assignment has been suggested. This work proposes a prioritized distance (PD) algorithm for making this assignment in an optimal manner by minimizing the probability of bit error union bound. The algorithm can be used on constellations constructed using any technique. Simulation results show this algorithm significantly outperforms random searches and achieves near globally optimum results with moderate complexity.
A. Panagos and K. L. Kosbar, "A Gray-Code Type Bit Assignment Algorithm for Unitary Space-Time Constellations," Proceedings of the IEEE Global Telecommunications Conference, 2007, Institute of Electrical and Electronics Engineers (IEEE), Jan 2007.
The definitive version is available at http://dx.doi.org/10.1109/GLOCOM.2007.761
IEEE Global Telecommunications Conference, 2007
Electrical and Computer Engineering
Keywords and Phrases
Gray Codes; Computational Complexity; Hamming Codes; Space-Time Codes
Article - Conference proceedings
© 2007 Institute of Electrical and Electronics Engineers (IEEE), All rights reserved.