Euclidean Distance Decomposition to Generate New 16-QAM and 64-QAM Space-Time Trellis Codes

Pierre Viland (1) , Gheorghe I. Zaharia (1) , Jean-François Hélard (2)

1 IETR - Institut d'Électronique et des Technologies du numéRique
2 IETR - Institut d'Electronique et de Télécommunications de Rennes

In this paper, the generation of 16-QAM and 64-QAM space-time trellis codes (STTCs) for several transmit antennas is considered. The main problem with an exhaustive search is the important time to find the best 2^{2n}-QAM STTCs, especially for great values of n and for great numbers of transmit antennas. In order to reduce this search time, an efficient method must be used to generate optimal 2^{2n}-QAM STTCs. Thus, a new method based on the decomposition of the Euclidean distance between 2 codewords is proposed to design the optimal STTCs. Thanks to this new method, the first 16-QAM STTCs with more than 2 transmit antennas and the first 64-QAM STTCs with 2 and 3 transmit antennas are proposed. The performance of these new codes is evaluated by simulation.

Mots clés: STTC; système MIMO; QAM

Domaines: Théorie de l'information [cs.IT]; Théorie de l'information et codage [math.IT]

Pierre Viland, Gheorghe I. Zaharia, Jean-François Hélard. Euclidean Distance Decomposition to Generate New 16-QAM and 64-QAM Space-Time Trellis Codes. PIMRC, Sep 2010, Istambul, Turkey. pp.1-5. ⟨hal-00542003⟩