Sciweavers

Share
GLOBECOM
2008
IEEE

Low-Complexity Maximum Likelihood Detection of Orthogonal Space-Time Block Codes

8 years 9 months ago
Low-Complexity Maximum Likelihood Detection of Orthogonal Space-Time Block Codes
Abstract— In this paper, we propose a low complexity Maximum Likelihood (ML) decoding algorithm for orthogonal spacetime 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 a system employing the well-known Alamouti OSTBC and 16QAM modulation scheme, the new approach achieves > 82% reduction in the overall complexity compared to conventional ML detection. Moreover, we 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.
Luay Azzam, Ender Ayanoglu
Added 29 May 2010
Updated 29 May 2010
Type Conference
Year 2008
Where GLOBECOM
Authors Luay Azzam, Ender Ayanoglu
Comments (0)
books