Optimizing Quasi-Orthogonal STBC Through Group-Constrained Linear Transformation
| dc.creator | Yuen, Chau | |
| dc.creator | Guan, Yong Liang | |
| dc.creator | Tjhung, Tjeng Thiang | |
| dc.date | 2008-06-20 | |
| dc.date.accessioned | 2026-07-07T09:45:50Z | |
| dc.date.available | 2026-07-07T09:45:50Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/0806.3324 | |
| dc.identifier | http://arxiv.org/abs/0806.3324 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/163331 | |
| dc.subject | Information Theory | |
| dc.title | Optimizing Quasi-Orthogonal STBC Through Group-Constrained Linear Transformation | |
| dc.type | text |