A novel maximum likelihood decoding algorithm for orthogonal space-time block codes

Authors:
Luay Azzam;Ender Ayanoglu
Affiliations:
Center for Pervasive Communications and Computing, Department of Electrical Engineering and Computer Science, University of California, Irvine;Center for Pervasive Communications and Computing, Department of Electrical Engineering and Computer Science, University of California, Irvine
Venue:
IEEE Transactions on Communications
Year:
2009

Citing 8
Cited 0

Matrix computations (3rd ed.)

Matrix computations (3rd ed.)
Energy-efficient channel estimation in MIMO systems

EURASIP Journal on Wireless Communications and Networking
Space-Time Coding: Theory and Practice

Space-Time Coding: Theory and Practice
Space-time block codes from orthogonal designs

IEEE Transactions on Information Theory
Universal space-time coding

IEEE Transactions on Information Theory
Space-time processing for broadband wireless access

IEEE Communications Magazine
A simple transmit diversity technique for wireless communications

IEEE Journal on Selected Areas in Communications
Space-time block coding for wireless communications: performance results

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this letter, we propose a low complexity Maximum Likelihood (ML) decoding algorithm for orthogonal space-time block codes (OSTBCs) based on the real-valued lattice representation and QR decomposition. We show that for a system with rate r = K/T, where K is the number of transmitted symbols per T time slots, the proposed algorithm decomposes the original complex-valued system into a parallel system represented by 2K real-valued components, thus allowing for a simple and independent detection of the real and imaginary parts of each complex transmitted symbol. We further show that for square L-QAM constellations, the proposed algorithm reduces the decoding computational complexity from O(L) for conventional ML to O(√L) without sacrificing the performance.