Papers
Topics
Authors
Recent
Search
2000 character limit reached

Optimizing Quasi-Orthogonal STBC Through Group-Constrained Linear Transformation

Published 20 Jun 2008 in cs.IT and math.IT | (0806.3324v1)

Abstract: 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.

Citations (18)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.