2008 Fourth Advanced International Conference on Telecommunications Efficient ML Decoder for Quasi-orthogonal Space-Time Codes When Using QAM Constellation June 08-June 13 ISBN: 978-0-7695-3162-5
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/AICT.2008.20
The most attractive class of space-time codes comprises the full-rate orthogonal codes, such as the Alamouti code. These codes allow a simple individual decoding of each symbol of the space-time block, leading to a reduced complexity at the receiver. They exist however only for two transmit antennas. If one intends to increase the transmit diversity order, then it may either use a sub-unitary rate orthogonal code or use a full-rate quasi-orthogonal code in which the decoding is done in pairs of symbols. Unfortunately, the pair-wise decoding leads to a large search space of the Maximum Likelihood (ML) decoder, especially for high-rate constellations, such as 16-QAM or 64-QAM. This paper presents a less complex general ML decoding algorithm, with linear pre-processing phase, applicable for a class of quasi-orthogonal space-time codes with rectangular constellations (e.g. QPSK, 16-QAM, 64-QAM).
Index Terms:
quasi-orthogonal codes, space-time coding, ml decoder
Citation:
Andrei Alexandru Enescu, Silviu Ciochina, Constantin Paleologu, "Efficient ML Decoder for Quasi-orthogonal Space-Time Codes When Using QAM Constellation," aict, pp.346-349, 2008 Fourth Advanced International Conference on Telecommunications, 2008 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb