By Topic

On the ML Decoding of Quasi-Orthogonal Space-Time Block Codes via Sphere Decoding and Exhaustive Search

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
$33 $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)
Jeff Leuschner ; Student Member, IEEE ; Shahram Yousefi

For the large family of quasi-orthogonal space-time block codes, it is not clear when is best to decode using an exhaustive search, and when the sphere decoding algorithm (SDA) should be applied. In investigating this practical issue, a generic maximum-likelihood metric expression is utilized which is more conducive to lowering the decoding complexity. It is then shown that for smaller constellations and/or number of transmit antenna, the complexity advantage of smart exhaustive search in comparison with sphere decoding can be significant.

Published in:

IEEE Transactions on Wireless Communications  (Volume:7 ,  Issue: 11 )