Unitary Alamouti code design from APSK signals with fast maximum-likelihood decoding algorithm

Aijun Song*, Genyuan Wang, Weifeng Su, Xiang Gen Xia

*此作品的通讯作者

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

1 引用 (Scopus)

摘要

Unitary orthogonal space-time codes, constructed from Alamouti's scheme, has the advantage of its fast maximum-likelihood (ML) decoding but it requires signal constellations to be phase shift keying (PSK). In this paper, unitary space-time codes are constructed from Alamouti's scheme with amplitude/phase shift keying (APSK) signal constellations. We show that the unitary space-time codes from Alamouti's scheme with APSK signals have better diversity products than those with PSK signals. Our proposed rate 4 bits/s/Hz code has about 2 dB gain over the one of the same rate but with PSK signals at bit error rate (BER) of 10-3 with one receive antenna. Additionally, our proposed codes have fast ML decoding algorithm, whose complexity is comparable to that of unitary orthogonal space-time codes.

源语言英语
页(从-至)210
页数1
期刊IEEE International Symposium on Information Theory - Proceedings
出版状态已出版 - 2003
已对外发布
活动Proceedings 2003 IEEE International Symposium on Information Theory (ISIT) - Yokohama, 日本
期限: 29 6月 20034 7月 2003

指纹

探究 'Unitary Alamouti code design from APSK signals with fast maximum-likelihood decoding algorithm' 的科研主题。它们共同构成独一无二的指纹。

引用此

Song, A., Wang, G., Su, W., & Xia, X. G. (2003). Unitary Alamouti code design from APSK signals with fast maximum-likelihood decoding algorithm. IEEE International Symposium on Information Theory - Proceedings, 210.