Computer Science – Information Theory
Scientific paper
2008-06-20
Computer Science
Information Theory
Scientific paper
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.
Guan Yong Liang
Tjhung Tjeng Thiang
Yuen Chau
No associations
LandOfFree
Optimizing Quasi-Orthogonal STBC Through Group-Constrained Linear Transformation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Optimizing Quasi-Orthogonal STBC Through Group-Constrained Linear Transformation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimizing Quasi-Orthogonal STBC Through Group-Constrained Linear Transformation will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-371035