A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is
Maximum Likelihood Detection of Quasi-Orthogonal Space-Time Block Codes: Analysis and Simplification
2008 IEEE International Conference on Communications
In this paper, 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 × 2 real-valued components, thus allowing for a simple joint decoding of twodoi:10.1109/icc.2008.742 dblp:conf/icc/AzzamA08 fatcat:q7ao7wulcnf2refqblfjkvpuwm