By Topic

A Low Complexity 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

3 Author(s)
Alabed, S.J. ; Commun. Syst. Group, Darmstadt Univ. of Technol., Darmstadt, Germany ; Paredes, J.M. ; Gershman, A.B.

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.

Published in:

Wireless Communications, IEEE Transactions on  (Volume:10 ,  Issue: 3 )