Cart (Loading....) | Create Account
Close category search window

Low-Complexity SQR-Based Decoding Algorithm 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

2 Author(s)
Azzam, L. ; Dept. of Electr. Eng. & Comput. Sci., Univ. of California, Irvine, CA ; Ayanoglu, E.

In this paper, we propose a new decoding algorithm for quasiorthogonal space-time block codes (QOSTBCs) which achieves near maximum likelihood (ML) performance while substantially reducing the decoding complexity. 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 2times2 real-valued components, thus allowing for a simple decoding of one real symbol at a time. For a square QAM constellation with L points (L-QAM), this algorithm achieves full diversity by properly incorporating two-dimensional rotation using the optimal rotation angle and the same rotating matrix for any number of transmit antennas (Nges4). We show that the complexity of this algorithm is linear with the number of transmitted symbols ns, and is independent of the constellation size L.

Published in:

Global Telecommunications Conference, 2008. IEEE GLOBECOM 2008. IEEE

Date of Conference:

Nov. 30 2008-Dec. 4 2008

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.