A New Family of Low-Complexity Decodable STBCs for 4 Transmit Antennas

Abstract : In this paper we propose a new construction method for rate-1 Fast-Group-Decodable (FGD) Space-Time-Block Codes (STBC)s for 2^a transmit antennas. We focus on the case of a=2 and we show that the new FGD rate-1 code has the lowest worst-case decoding complexity among existing comparable STBCs. The coding gain of the new rate-1 code is then optimized through constellation stretching and proved to be constant irrespective of the underlying QAM constellation prior to normalization. In a second step, we propose a new rate-2 STBC that multiplexes two of our rate-1 codes by the means of a unitary matrix. A compromise between rate and complexity is then obtained through puncturing our rate-2 code giving rise to a new rate-3/2 code. The proposed codes are compared to existing codes in the literature and simulation results show that our rate-3/2 code has a lower average decoding complexity while our rate-2 code maintains its lower average decoding complexity in the low SNR region at the expense of a small performance loss.
Complete list of metadatas

https://hal-supelec.archives-ouvertes.fr/hal-00747393
Contributor : Catherine Magnet <>
Submitted on : Wednesday, October 31, 2012 - 11:23:24 AM
Last modification on : Thursday, March 29, 2018 - 11:06:05 AM

Links full text

Identifiers

Collections

Citation

Amr Ismail, Jocelyn Fiorina, Hikmet Sari. A New Family of Low-Complexity Decodable STBCs for 4 Transmit Antennas. 2012 IEEE International Conference on Communications (ICC), Jun 2012, Ottawa, Canada. ⟨10.1109/ICC.2012.6364324⟩. ⟨hal-00747393⟩

Share

Metrics

Record views

191