On the ML decoding of quasi-orthogonal space-time block codes via sphere decoding and exhaustive search

Authors:
Jeff Leuschner;Shahram Yousefi
Affiliations:
Queen's University, Kingston, ON, Canada;Queen's University, Kingston, ON, Canada
Venue:
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
Year:
2007

Citing 6
Cited 0

Space-Time Block Coding for Wireless Communications

Space-Time Block Coding for Wireless Communications
Quasi-orthogonal STBC with minimum decoding complexity

IEEE Transactions on Wireless Communications
Space-time block codes from orthogonal designs

IEEE Transactions on Information Theory
High-rate codes that are linear in space and time

IEEE Transactions on Information Theory
On maximum-likelihood detection and the search for the closest lattice point

IEEE Transactions on Information Theory
Single-symbol maximum likelihood decodable linear STBCs

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the following question: for the large family of quasi-orthogonal space-time block code (QOSTBCs), when is it best to decode using an exhaustive search, and when should the sphere decoding algorithm (SDA) be applied? First, a simple and intuitive generic metric expression for QOSTBCs is proposed. The new metric expression makes it easier to find the simplified and partially decoupled metric than if working from the Forbenius norm. A new rate-one full-diversity 8 antenna QOSTBC is then constructed that has lower decoding complexity than that in [3]. Finally, the question of when to use the SDA is considered.