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

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

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

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

^*Corresponding author for this work

Research output: Contribution to journal › Conference article › peer-review

1 Citation (Scopus)

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
Pages (from-to)	210
Number of pages	1
Journal	IEEE International Symposium on Information Theory - Proceedings
Publication status	Published - 2003
Externally published	Yes
Event	Proceedings 2003 IEEE International Symposium on Information Theory (ISIT) - Yokohama, Japan Duration: 29 Jun 2003 → 4 Jul 2003

Cite this

@article{b1335212a7ab41d2ac6c642e82ff69a9,

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",

language = "English",

pages = "210",

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

issn = "2157-8095",

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

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

}

TY - JOUR

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 - http://www.scopus.com/inward/record.url?scp=0141904572&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0141904572

SN - 2157-8095

SP - 210

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

T2 - Proceedings 2003 IEEE International Symposium on Information Theory (ISIT)

Y2 - 29 June 2003 through 4 July 2003

ER -

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

Abstract

Other files and links

Fingerprint

Cite this