Quasi-orthogonal space-time block codes with full diversity

Weifeng Su*, Xiang Gen Xia

*此作品的通讯作者

科研成果: 期刊稿件会议文章同行评审

4 引用 (Scopus)

摘要

Space-time block codes from orthogonal designs proposed by Alamouti, and Tarokh-Jafarkhani-Calderbank have attracted much attention lately due to their fast maximum-likelihood (ML) decoding and full diversity. However, the maximum symbol transmission rate of a space-time block code from complex orthogonal designs for complex constellations is only 3/4 for three and four transmit antennas. Recently, Jafarkhani, and Tirkkonen-Boariu-Hottinen proposed space-time block codes from quasi-orthogonal designs, where the orthogonality is relaxed to provide higher symbol transmission rates. With the quasi-orthogonal structure, these codes still have a fast ML decoding algorithm, but do not have the full diversity. The performance of these codes is better than that of the codes from orthogonal designs at low SNR, but worse at high SNR. This is due to the fact that the slope of the BER-SNR curve depends on the diversity. In this paper, we design quasi-orthogonal space-time block codes with full diversity by properly choosing the signal constellations. In particular, we propose that half of the symbols in a quasi-orthogonal design are from a signal constellation A and another half of them are optimal selections from the rotated constellation e A. The optimal rotation angles φ are obtained for some commonly used signal constellations. The resulting codes have both full diversity and fast ML decoding. Simulation results show that the proposed codes outperform the codes from orthogonal designs at both low and high SNRs.

源语言英语
页(从-至)283-294
页数12
期刊Proceedings of SPIE - The International Society for Optical Engineering
4791
DOI
出版状态已出版 - 2002
已对外发布
活动Advanced Signal Processing Algorithms, Architectures, and Implementations XII - Seattle, WA, 美国
期限: 9 7月 200211 7月 2002

指纹

探究 'Quasi-orthogonal space-time block codes with full diversity' 的科研主题。它们共同构成独一无二的指纹。

引用此