Asterism decoding for layered space-time systems

Phillip Conder, Tadeusz A. Wysocki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The area of Layered Space-Time (LST) systems has received enormous attention recently as they can provide a roughly linear increase in data rate by using Multiple Transmit and Receive antennas. The optimal detection strategy for a LST receiver is to perform a Maximum-Likelihood (ML) search over all possible transmitted symbol combinations. The decoding scheme proposed in this paper, called Asterism decoding, looks for a more efficient way of finding the ML solution by first considering the case of multiple transmit antennas and a single receive antenna. The decoder is then extended to achieve ML like performance for any number of receive antennas. It is then shown that Asterism decoding has an approximate order of magnitude reduction in computational complexity when compared to ML decoding. Asterism decoding is the first lower complexity decoder that achieves ML-like performance for systems where the number of receive antennas is less than the number of transmit antennas without the additional use of error coding.

Original languageEnglish (US)
Title of host publication15th International Conference on Microwaves, Radar and Wireless Communications, MIKON - 2004
Pages729-732
Number of pages4
StatePublished - Dec 1 2004
Event15th International Conference on Microwaves, Radar and Wireless Communications, MIKON - 2004 - Warszawa, Poland
Duration: May 17 2004May 19 2004

Publication series

Name15th International Conference on Microwaves, Radar and Wireless Communications, MIKON - 2004
Volume2

Other

Other15th International Conference on Microwaves, Radar and Wireless Communications, MIKON - 2004
CountryPoland
CityWarszawa
Period5/17/045/19/04

Fingerprint

Decoding
Maximum likelihood
Antennas
Coding errors
Computational complexity

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Conder, P., & Wysocki, T. A. (2004). Asterism decoding for layered space-time systems. In 15th International Conference on Microwaves, Radar and Wireless Communications, MIKON - 2004 (pp. 729-732). (15th International Conference on Microwaves, Radar and Wireless Communications, MIKON - 2004; Vol. 2).

Asterism decoding for layered space-time systems. / Conder, Phillip; Wysocki, Tadeusz A.

15th International Conference on Microwaves, Radar and Wireless Communications, MIKON - 2004. 2004. p. 729-732 (15th International Conference on Microwaves, Radar and Wireless Communications, MIKON - 2004; Vol. 2).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Conder, P & Wysocki, TA 2004, Asterism decoding for layered space-time systems. in 15th International Conference on Microwaves, Radar and Wireless Communications, MIKON - 2004. 15th International Conference on Microwaves, Radar and Wireless Communications, MIKON - 2004, vol. 2, pp. 729-732, 15th International Conference on Microwaves, Radar and Wireless Communications, MIKON - 2004, Warszawa, Poland, 5/17/04.
Conder P, Wysocki TA. Asterism decoding for layered space-time systems. In 15th International Conference on Microwaves, Radar and Wireless Communications, MIKON - 2004. 2004. p. 729-732. (15th International Conference on Microwaves, Radar and Wireless Communications, MIKON - 2004).
Conder, Phillip ; Wysocki, Tadeusz A. / Asterism decoding for layered space-time systems. 15th International Conference on Microwaves, Radar and Wireless Communications, MIKON - 2004. 2004. pp. 729-732 (15th International Conference on Microwaves, Radar and Wireless Communications, MIKON - 2004).
@inproceedings{2e93896f4ec54362838d6c97575f65d3,
title = "Asterism decoding for layered space-time systems",
abstract = "The area of Layered Space-Time (LST) systems has received enormous attention recently as they can provide a roughly linear increase in data rate by using Multiple Transmit and Receive antennas. The optimal detection strategy for a LST receiver is to perform a Maximum-Likelihood (ML) search over all possible transmitted symbol combinations. The decoding scheme proposed in this paper, called Asterism decoding, looks for a more efficient way of finding the ML solution by first considering the case of multiple transmit antennas and a single receive antenna. The decoder is then extended to achieve ML like performance for any number of receive antennas. It is then shown that Asterism decoding has an approximate order of magnitude reduction in computational complexity when compared to ML decoding. Asterism decoding is the first lower complexity decoder that achieves ML-like performance for systems where the number of receive antennas is less than the number of transmit antennas without the additional use of error coding.",
author = "Phillip Conder and Wysocki, {Tadeusz A.}",
year = "2004",
month = "12",
day = "1",
language = "English (US)",
isbn = "8390666278",
series = "15th International Conference on Microwaves, Radar and Wireless Communications, MIKON - 2004",
pages = "729--732",
booktitle = "15th International Conference on Microwaves, Radar and Wireless Communications, MIKON - 2004",

}

TY - GEN

T1 - Asterism decoding for layered space-time systems

AU - Conder, Phillip

AU - Wysocki, Tadeusz A.

PY - 2004/12/1

Y1 - 2004/12/1

N2 - The area of Layered Space-Time (LST) systems has received enormous attention recently as they can provide a roughly linear increase in data rate by using Multiple Transmit and Receive antennas. The optimal detection strategy for a LST receiver is to perform a Maximum-Likelihood (ML) search over all possible transmitted symbol combinations. The decoding scheme proposed in this paper, called Asterism decoding, looks for a more efficient way of finding the ML solution by first considering the case of multiple transmit antennas and a single receive antenna. The decoder is then extended to achieve ML like performance for any number of receive antennas. It is then shown that Asterism decoding has an approximate order of magnitude reduction in computational complexity when compared to ML decoding. Asterism decoding is the first lower complexity decoder that achieves ML-like performance for systems where the number of receive antennas is less than the number of transmit antennas without the additional use of error coding.

AB - The area of Layered Space-Time (LST) systems has received enormous attention recently as they can provide a roughly linear increase in data rate by using Multiple Transmit and Receive antennas. The optimal detection strategy for a LST receiver is to perform a Maximum-Likelihood (ML) search over all possible transmitted symbol combinations. The decoding scheme proposed in this paper, called Asterism decoding, looks for a more efficient way of finding the ML solution by first considering the case of multiple transmit antennas and a single receive antenna. The decoder is then extended to achieve ML like performance for any number of receive antennas. It is then shown that Asterism decoding has an approximate order of magnitude reduction in computational complexity when compared to ML decoding. Asterism decoding is the first lower complexity decoder that achieves ML-like performance for systems where the number of receive antennas is less than the number of transmit antennas without the additional use of error coding.

UR - http://www.scopus.com/inward/record.url?scp=11244287275&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=11244287275&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:11244287275

SN - 8390666278

SN - 9788390666273

T3 - 15th International Conference on Microwaves, Radar and Wireless Communications, MIKON - 2004

SP - 729

EP - 732

BT - 15th International Conference on Microwaves, Radar and Wireless Communications, MIKON - 2004

ER -