Title :
A Low Complexity Decoder for Quasi-Orthogonal Space Time Block Codes
Author :
Alabed, Samer J. ; Paredes, Javier M. ; Gershman, Alex B.
Author_Institution :
Commun. Syst. Group, Darmstadt Univ. of Technol., Darmstadt, Germany
fDate :
3/1/2011 12:00:00 AM
Abstract :
In this paper, a low-complexity suboptimal decoder for coherent and non-coherent quasi-orthogonal space time block codes with three and four transmit antennas is proposed. Our decoder enjoys a nearly linear complexity and approximately the same performance as the optimal maximum-likelihood (ML) decoder. Simulations show the advantages of the proposed decoder with respect to several other popular approaches to the coherent and non-coherent decoding.
Keywords :
antenna arrays; computational complexity; maximum likelihood decoding; orthogonal codes; space-time block codes; transmitting antennas; ML decoder; coherent decoding; linear complexity; low-complexity decoder; noncoherent decoding; optimal maximum-likelihood decoder; quasiorthogonal space time block codes; transmit antennas; Multiple-input multiple-output (MIMO) systems; differential space-time coding (DSTC); low decoding complexity; quasi-orthogonal space time block codes;
Journal_Title :
Wireless Communications, IEEE Transactions on
DOI :
10.1109/TWC.2011.010411.101263
