By Topic

Real-valued maximum likelihood decoder for quasi-orthogonal space-time block codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Azzam, L. ; Dept. of Electr. Eng. & Comput. Sci., Univ. of California, Irvine, CA, USA ; Ayanoglu, E.

In this letter, we propose a low complexity Maximum Likelihood (ML) decoding algorithm for quasi-orthogonal space-time block codes (QOSTBCs) based on the real-valued lattice representation and QR decomposition. We show that for a system with rate r = ns/T, where ns is the number of transmitted symbols per T time slots; the proposed algorithm decomposes the original complex-valued system into a parallel system with ns 2 times 2 real-valued components, thus allowing for a simple joint decoding of two real symbols. For a square QAM constellation with L points (L-QAM), this algorithm achieves full diversity by properly incorporating two-dimensional rotation using the optimal rotation angle and the same rotating matrix for any number of transmit antennas (N ges 4). We show that the complexity gain becomes greater when N or L becomes larger. The complexity of the proposed algorithm is shown to be linear with the number of transmitted symbols ns.

Published in:

Communications, IEEE Transactions on  (Volume:57 ,  Issue: 8 )