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

Aijun Song; Genyuan Wang; Weifeng Su; Xiang Gen Xia

doi:10.1109/ISIT.2003.1228224

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

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

Department of Electrical Engineering

University of Delaware
Chinese University of Hong Kong

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Abstract

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.

Original language	English
Title of host publication	Proceedings - 2003 IEEE International Symposium on Information Theory, ISIT 2003
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	210
Number of pages	1
ISBN (Print)	0780377281
DOIs	https://doi.org/10.1109/ISIT.2003.1228224
State	Published - 2003
Event	2003 IEEE International Symposium on Information Theory, SIT 2003 - Yokohama, Japan Duration: Jun 29 2003 → Jul 4 2003

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8095

Conference

Conference	2003 IEEE International Symposium on Information Theory, SIT 2003
Country/Territory	Japan
City	Yokohama
Period	06/29/03 → 07/4/03

Access to Document

10.1109/ISIT.2003.1228224

Cite this

Song, A., Wang, G., Su, W., & Xia, X. G. (2003). Unitary Alamouti code design from APSK signals with fast maximum-likelihood decoding algorithm. In Proceedings - 2003 IEEE International Symposium on Information Theory, ISIT 2003 (pp. 210). (IEEE International Symposium on Information Theory - Proceedings). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2003.1228224

@inproceedings{1512eca80f40483ca6f49215019aee5c,

title = "Unitary Alamouti code design from APSK signals with fast maximum-likelihood decoding algorithm",

abstract = "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.",

author = "Aijun Song and Genyuan Wang and Weifeng Su and Xia, \{Xiang Gen\}",

year = "2003",

doi = "10.1109/ISIT.2003.1228224",

language = "English",

isbn = "0780377281",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "210",

booktitle = "Proceedings - 2003 IEEE International Symposium on Information Theory, ISIT 2003",

address = "United States",

note = "2003 IEEE International Symposium on Information Theory, SIT 2003 ; Conference date: 29-06-2003 Through 04-07-2003",

}

Song, A, Wang, G, Su, W & Xia, XG 2003, Unitary Alamouti code design from APSK signals with fast maximum-likelihood decoding algorithm. in Proceedings - 2003 IEEE International Symposium on Information Theory, ISIT 2003. IEEE International Symposium on Information Theory - Proceedings, Institute of Electrical and Electronics Engineers Inc., pp. 210, 2003 IEEE International Symposium on Information Theory, SIT 2003, Yokohama, Japan, 06/29/03. https://doi.org/10.1109/ISIT.2003.1228224

Unitary Alamouti code design from APSK signals with fast maximum-likelihood decoding algorithm. / Song, Aijun; Wang, Genyuan; Su, Weifeng et al.
Proceedings - 2003 IEEE International Symposium on Information Theory, ISIT 2003. Institute of Electrical and Electronics Engineers Inc., 2003. p. 210 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Song, Aijun

AU - Wang, Genyuan

AU - Su, Weifeng

AU - Xia, Xiang Gen

PY - 2003

Y1 - 2003

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0141904572

U2 - 10.1109/ISIT.2003.1228224

DO - 10.1109/ISIT.2003.1228224

M3 - Conference contribution

AN - SCOPUS:0141904572

SN - 0780377281

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 210

BT - Proceedings - 2003 IEEE International Symposium on Information Theory, ISIT 2003

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2003 IEEE International Symposium on Information Theory, SIT 2003

Y2 - 29 June 2003 through 4 July 2003

ER -

Song A, Wang G, Su W, Xia XG. Unitary Alamouti code design from APSK signals with fast maximum-likelihood decoding algorithm. In Proceedings - 2003 IEEE International Symposium on Information Theory, ISIT 2003. Institute of Electrical and Electronics Engineers Inc. 2003. p. 210. (IEEE International Symposium on Information Theory - Proceedings). doi: 10.1109/ISIT.2003.1228224

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

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this