Rotated and scaled alamouti coding

F.M.J. Willems

doi:10.1109/ISIT.2008.4595195

Rotated and scaled alamouti coding

F.M.J. Willems

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

3 Citations (Scopus)

63 Downloads (Pure)

Abstract

Repetition-based retransmission is used in Alamouti-modulation [1998] for 2 times 2 MIMO systems. We propose to use instead of ordinary repetition so-called dasiascaled repetitionpsila together with rotation. It is shown that the rotated and scaled Alamouti code has a hard-decision performance which is only slightly worse than that of the Golden code [2005], the best known 2 times 2 space-time code. Decoding the Golden code requires an exhaustive search over all the codewords (or sphere decoding for higher spectral efficiencies), while our rotated and scaled Alamouti code can be decoded with an acceptable complexity.

Original language	English
Title of host publication	Proceedings of the 2008 IEEE International Symposium on Information Theory (ISIT 2008) 6 - 11 July 2008, Toronto, Ontario, Canada
Place of Publication	Piscataway
Publisher	Institute of Electrical and Electronics Engineers
Pages	1288-1292
DOIs	https://doi.org/10.1109/ISIT.2008.4595195
Publication status	Published - 2008
Event	2008 IEEE International Symposium on Information Theory, ISIT 2008 - Toronto, Canada Duration: 6 Jul 2008 → 11 Jul 2008

Conference

Conference	2008 IEEE International Symposium on Information Theory, ISIT 2008
Country/Territory	Canada
City	Toronto
Period	6/07/08 → 11/07/08
Other	IEEE ISIT 2008, Toronto, Ontario, Canada

Access to Document

10.1109/ISIT.2008.4595195

Metis222733Final published version, 156 KB

Cite this

@inproceedings{6a8f54430f614e8d825e548c4e78551d,

title = "Rotated and scaled alamouti coding",

abstract = "Repetition-based retransmission is used in Alamouti-modulation [1998] for 2 times 2 MIMO systems. We propose to use instead of ordinary repetition so-called dasiascaled repetitionpsila together with rotation. It is shown that the rotated and scaled Alamouti code has a hard-decision performance which is only slightly worse than that of the Golden code [2005], the best known 2 times 2 space-time code. Decoding the Golden code requires an exhaustive search over all the codewords (or sphere decoding for higher spectral efficiencies), while our rotated and scaled Alamouti code can be decoded with an acceptable complexity.",

author = "F.M.J. Willems",

year = "2008",

doi = "10.1109/ISIT.2008.4595195",

language = "English",

pages = "1288--1292",

booktitle = "Proceedings of the 2008 IEEE International Symposium on Information Theory (ISIT 2008) 6 - 11 July 2008, Toronto, Ontario, Canada",

publisher = "Institute of Electrical and Electronics Engineers",

address = "United States",

note = "2008 IEEE International Symposium on Information Theory, ISIT 2008 ; Conference date: 06-07-2008 Through 11-07-2008",

}

Willems, FMJ 2008, Rotated and scaled alamouti coding. in Proceedings of the 2008 IEEE International Symposium on Information Theory (ISIT 2008) 6 - 11 July 2008, Toronto, Ontario, Canada. Institute of Electrical and Electronics Engineers, Piscataway, pp. 1288-1292, 2008 IEEE International Symposium on Information Theory, ISIT 2008, Toronto, Canada, 6/07/08. https://doi.org/10.1109/ISIT.2008.4595195

Rotated and scaled alamouti coding. / Willems, F.M.J.
Proceedings of the 2008 IEEE International Symposium on Information Theory (ISIT 2008) 6 - 11 July 2008, Toronto, Ontario, Canada. Piscataway: Institute of Electrical and Electronics Engineers, 2008. p. 1288-1292.

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

TY - GEN

T1 - Rotated and scaled alamouti coding

AU - Willems, F.M.J.

PY - 2008

Y1 - 2008

N2 - Repetition-based retransmission is used in Alamouti-modulation [1998] for 2 times 2 MIMO systems. We propose to use instead of ordinary repetition so-called dasiascaled repetitionpsila together with rotation. It is shown that the rotated and scaled Alamouti code has a hard-decision performance which is only slightly worse than that of the Golden code [2005], the best known 2 times 2 space-time code. Decoding the Golden code requires an exhaustive search over all the codewords (or sphere decoding for higher spectral efficiencies), while our rotated and scaled Alamouti code can be decoded with an acceptable complexity.

AB - Repetition-based retransmission is used in Alamouti-modulation [1998] for 2 times 2 MIMO systems. We propose to use instead of ordinary repetition so-called dasiascaled repetitionpsila together with rotation. It is shown that the rotated and scaled Alamouti code has a hard-decision performance which is only slightly worse than that of the Golden code [2005], the best known 2 times 2 space-time code. Decoding the Golden code requires an exhaustive search over all the codewords (or sphere decoding for higher spectral efficiencies), while our rotated and scaled Alamouti code can be decoded with an acceptable complexity.

U2 - 10.1109/ISIT.2008.4595195

DO - 10.1109/ISIT.2008.4595195

M3 - Conference contribution

SP - 1288

EP - 1292

BT - Proceedings of the 2008 IEEE International Symposium on Information Theory (ISIT 2008) 6 - 11 July 2008, Toronto, Ontario, Canada

PB - Institute of Electrical and Electronics Engineers

CY - Piscataway

T2 - 2008 IEEE International Symposium on Information Theory, ISIT 2008

Y2 - 6 July 2008 through 11 July 2008

ER -

Rotated and scaled alamouti coding

Abstract

Conference

Access to Document

Fingerprint

Cite this