Optimizing quasi-orthogonal STBC through group-constrained linear transformation

Chau Yuen*, Yong Liang Guan, Tjeng Thiang Tjhung

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

12 Citations (Scopus)

Abstract

In this paper, we first derive the generic algebraic structure of a Quasi-Orthogonal STBC (QO-STBC). Nest we propose Group-Constrained Linear Transformation (GCLT) as a mean to optimize the diversity and coding gains of a QO-STBC. Compared with the constellation rotation (CR) technique reported in the literature, we show that QO-STBC with GCLT requires only half the number of symbols for joint detection in the maximum-likelihood (ML) decoder when square or rectangular QAM constellations are used, hence it has lower decoding complexity than QO-STBC with CR We also derive analytically the optimum GCLT Parameters for QO-STBC with generic square or rectangular QAM constellation for four and eight transmit antennas. The resultant QO-STBCs with GCLT can achieve full transmit diversity, and they have negligible performance loss compared with QO-STBCs with CR at the same code rate.

Original languageEnglish
Pages550-554
Number of pages5
Publication statusPublished - 2004
Externally publishedYes
EventGLOBECOM'04 - IEEE Global Telecommunications Conference - Dallas, TX, United States
Duration: Nov 29 2004Dec 3 2004

Conference

ConferenceGLOBECOM'04 - IEEE Global Telecommunications Conference
Country/TerritoryUnited States
CityDallas, TX
Period11/29/0412/3/04

ASJC Scopus Subject Areas

  • General Engineering

Keywords

  • Constellation rotation
  • Group-constrained linear transformation
  • Quasi-orthogonal space-time block code
  • Quasi-orthogonality constraint

Fingerprint

Dive into the research topics of 'Optimizing quasi-orthogonal STBC through group-constrained linear transformation'. Together they form a unique fingerprint.

Cite this