2008/06/20 by Chau Yuen, Yong Liang Guan, Yuen, Chau +3
Computer Science · Engineering · Mathematics · #Advanced Wireless Communication Techniques #Algorithms and Data Compression #Cellular Automata and Applications #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.0806.3324
arxiv created 2008/06/20 · openalex publication_date 2008/06/20 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper, we first derive the generic algebraic structure of a Quasi-Orthogonal STBC (QO-STBC). Next we propose Group-Constrained Linear Transformation (GCLT) as a means to optimize the diversity and coding gains of a QO-STBC with square or rectangular QAM constellations. Compared with QO-STBC with constellation rotation (CR), we show that QO-STBC with GCLT requires only half the number of symbols for joint detection, hence lower maximum-likelihood decoding complexity. We also derive analytically the optimum GCLT parameters for QO-STBC with square QAM constellation. The optimized QO-STBCs with GCLT are able to achieve full transmit diversity, and have negligible performance loss compared with QO-STBCs with CR at the same code rate.