TY - GEN

T1 - Asterism decoding for layered space-time systems using 8PSK

AU - Conder, Phillip

AU - Wysocki, Tadeusz A.

PY - 2004

Y1 - 2004

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 has an exponential complexity when the constellation size of number of transmit antennas increase. While sub-optimal decoders, such as VBLAST, provide linear decoding only where the number of receive antennas is at least equal to the number of transmit antennas. 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 further shows that Asterism decoding has at least 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 has an exponential complexity when the constellation size of number of transmit antennas increase. While sub-optimal decoders, such as VBLAST, provide linear decoding only where the number of receive antennas is at least equal to the number of transmit antennas. 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 further shows that Asterism decoding has at least 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=4143112462&partnerID=8YFLogxK

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

M3 - Conference contribution

AN - SCOPUS:4143112462

SN - 0780382196

T3 - 2004 IEEE/Sarnoff Symposium on Advances in Wired and Wireless Communication

SP - 11

EP - 13

BT - 2004 IEEE/Sarnoff Symposium on Advances in Wired and Wireless Communication

T2 - 2004 IEEE/Sarnoff Symposium on Advances in Wired and Wireless Communication

Y2 - 26 April 2004 through 27 April 2004

ER -