New efficient method to generate optimal 2^n-PSK space-time trellis codes with a large number of transmit antennas

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

1 IETR - Institut d'Electronique et de Télécommunications de Rennes

In this study, the author propose a new method called coset partitioning to generate easily and efficiently the best space-time trellis codes (STTCs), thereby reducing considerably the usual important search time. This method, used in the case of 2^n-PSK STTCs, is an extension of the set partitioning proposed by Ungerboeck based on the coset and lattice Calderbank's approach. The main guideline of the coset partitioning is to divide the set of multiple input and output symbols into cosets, not into simple sets as the set partitioning. The case of a large number of transmit antennas is considered because the time to obtain the best STTCs with an exhaustive search is very important when the number of transmit antennas increases. Using the coset partitioning, new 4-PSK STTCs with five to six transmit antennas are generated. Simulation results show that the new codes slightly outperform the best corresponding known codes. Thanks to the effectiveness of the coset partitioning, for the first time, 4-PSK STTCs with seven and eight transmit antennas and 8-PSK STTCs with five to six transmit antennas are obtained. Their performance is also analysed by simulation.

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. New efficient method to generate optimal 2^n-PSK space-time trellis codes with a large number of transmit antennas. IET Communications, 2011, 5 (10), pp.1413 - 1420. ⟨10.1049/iet-com.2010.0252⟩. ⟨hal-00617990⟩